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:18Victor MerckléVictor MerckléScore: 3,870Success
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:193,82740,237,02330,718,0001,049,0002,117,632stderr
2Aug 11, 2026 17:193,84740,335,52730,785,0001,147,0002,117,632stderr
3Aug 11, 2026 17:193,85040,344,41930,921,0001,035,0002,117,632stderr
4Aug 11, 2026 17:193,85740,437,94330,825,0001,193,0002,117,632stderr
5Aug 11, 2026 17:193,87040,469,85131,084,0001,038,0002,117,632stderr
6Aug 11, 2026 17:193,87240,501,65631,106,0001,033,0002,117,632stderr
7Aug 11, 2026 17:193,87641,899,63631,035,0001,138,0002,117,632stderr
8Aug 11, 2026 17:193,93641,077,42331,573,0001,096,0002,117,632stderr
9Aug 11, 2026 17:194,08442,334,81832,786,0001,114,0002,117,632stderr