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 11, 2026 17:49Victor MerckléVictor MerckléScore: 4,058Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 17:503,99341,540,46932,101,0001,042,0002,117,632stderr
2Aug 11, 2026 17:504,00641,656,51232,223,0001,032,0002,117,632stderr
3Aug 11, 2026 17:504,01141,728,13332,215,0001,079,0002,117,632stderr
4Aug 11, 2026 17:504,02141,804,06132,267,0001,112,0002,117,632stderr
5Aug 11, 2026 17:504,05842,127,42332,567,0001,116,0002,117,632stderr
6Aug 11, 2026 17:504,06542,121,85132,638,0001,106,0002,117,632stderr
7Aug 11, 2026 17:504,11642,558,45733,058,0001,108,0002,117,632stderr
8Aug 11, 2026 17:504,14643,036,86433,302,0001,112,0002,117,632stderr
9Aug 11, 2026 17:504,19243,221,04333,685,0001,112,0002,117,632stderr