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 23, 2026 20:16Victor MerckléVictor MerckléScore: 3,759Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 20:173,74540,091,50429,974,0001,112,0002,117,632stderr
2Aug 23, 2026 20:173,75339,378,84430,022,0001,135,0002,117,632stderr
3Aug 23, 2026 20:173,75439,539,14930,090,0001,070,0002,117,632stderr
4Aug 23, 2026 20:173,75640,141,95530,046,0001,135,0002,117,632stderr
5Aug 23, 2026 20:173,75939,529,79530,132,0001,070,0002,117,632stderr
6Aug 23, 2026 20:173,77739,786,79930,261,0001,091,0002,117,632stderr
7Aug 23, 2026 20:173,77840,919,44730,270,0001,092,0002,117,632stderr
8Aug 23, 2026 20:173,83440,202,55330,805,0001,021,0002,117,632stderr
9Aug 23, 2026 20:173,84040,261,66030,754,0001,119,0002,117,632stderr