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 12, 2026 06:55Victor MerckléVictor MerckléScore: 3,780Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 06:563,76439,748,91330,076,0001,173,0002,113,536
2Aug 12, 2026 06:563,76439,704,01330,118,0001,129,0002,113,536
3Aug 12, 2026 06:563,77339,739,91530,201,0001,119,0002,113,536
4Aug 12, 2026 06:563,77639,973,33330,225,0001,121,0002,113,536
5Aug 12, 2026 06:563,78040,357,26130,220,0001,161,0002,113,536
6Aug 12, 2026 06:563,78239,761,31930,290,0001,102,0002,113,536
7Aug 12, 2026 06:563,78639,844,50930,351,0001,076,0002,113,536
8Aug 12, 2026 06:563,82340,208,40530,701,0001,038,0002,113,536
9Aug 12, 2026 06:564,07242,243,96532,732,0001,066,0002,113,536