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 listSep 4, 2026 09:09Victor MerckléVictor MerckléScore: 3,660Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 09:103,63738,663,01529,036,0001,159,0002,117,632stderr
2Sep 4, 2026 09:103,64938,743,13529,209,0001,085,0002,117,632stderr
3Sep 4, 2026 09:103,65438,815,16229,205,0001,131,0002,117,632stderr
4Sep 4, 2026 09:103,65638,834,68629,078,0001,274,0002,117,632stderr
5Sep 4, 2026 09:103,66038,818,24829,273,0001,105,0002,117,632stderr
6Sep 4, 2026 09:103,66338,869,39029,289,0001,121,0002,117,632stderr
7Sep 4, 2026 09:103,67538,927,00529,426,0001,081,0002,117,632stderr
8Sep 4, 2026 09:103,68939,024,65129,540,0001,085,0002,117,632stderr
9Sep 4, 2026 09:103,70239,148,82529,584,0001,145,0002,117,632stderr