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 listMar 10, 2026 18:23Sergey SerebryakovSergey SerebryakovScore: 9,137Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 18:238,63497,019,33969,645,0002,018,0002,400,256
2Mar 10, 2026 18:238,723100,050,94870,392,0002,011,0002,265,088
3Mar 10, 2026 18:238,77299,022,19570,814,0001,994,0002,265,088
4Mar 10, 2026 18:239,137102,463,24574,844,000997,0002,392,064
5Mar 10, 2026 18:239,16099,185,41174,029,0002,000,0002,265,088
6Mar 10, 2026 18:239,16397,855,02273,055,0003,002,0002,404,352