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:34Maya RebholzMaya RebholzScore: 6,034Success
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:345,90363,827,70943,540,0005,463,0002,117,632
2May 25, 2026 20:345,99261,875,65844,457,0005,283,0002,113,536
3May 25, 2026 20:346,02261,479,23644,419,0005,568,0002,113,536
4May 25, 2026 20:346,03062,144,23444,374,0005,677,0002,113,536
5May 25, 2026 20:346,03462,459,02544,467,0005,616,0002,117,632
6May 25, 2026 20:346,08560,360,54244,879,0005,633,0002,117,632
7May 25, 2026 20:346,19563,166,65545,887,0005,538,0002,117,632
8May 25, 2026 20:346,26063,644,15946,373,0005,588,0002,117,632
9May 25, 2026 20:346,31064,411,96346,754,0005,622,0002,113,536