Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listAug 21, 2025 20:49Adam FolwarcznyAdam FolwarcznyScore: 19,201Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2025 20:4919,198180,967,392158,342,0001,002,0002,531,328
2Aug 21, 2025 20:4919,199179,108,973158,346,0001,002,0002,445,312
3Aug 21, 2025 20:4919,200179,625,965158,354,0001,002,0002,445,312
4Aug 21, 2025 20:4919,200183,318,943158,358,0001,002,0002,281,472
5Aug 21, 2025 20:4919,201188,579,591158,363,0001,002,0002,531,328
6Aug 21, 2025 20:4919,202181,236,195158,377,0001,002,0002,433,024
7Aug 21, 2025 20:4919,204184,820,379158,394,0001,002,0002,531,328
8Aug 21, 2025 20:4919,206181,483,430158,408,0001,002,0002,531,328
9Aug 21, 2025 20:4919,211182,913,899158,457,000996,0002,531,328