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 listMay 25, 2026 20:31Maya RebholzMaya RebholzScore: 6,046Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 20:315,90560,548,60243,661,0005,351,0002,117,632
2May 25, 2026 20:315,92460,350,87643,677,0005,496,0002,117,632
3May 25, 2026 20:315,99061,555,42944,188,0005,533,0002,113,536
4May 25, 2026 20:316,04561,641,00344,650,0005,526,0002,117,632
5May 25, 2026 20:316,04660,913,41844,718,0005,468,0002,113,536
6May 25, 2026 20:316,06662,026,25044,821,0005,527,0002,117,632
7May 25, 2026 20:316,07962,182,80244,856,0005,606,0002,117,632
8May 25, 2026 20:316,08062,708,23944,910,0005,557,0002,113,536
9May 25, 2026 20:316,19662,023,96445,984,0005,447,0002,117,632