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 listSep 17, 2026 01:41Andrew EpsteinAndrew EpsteinScore: 3,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 01:413,56139,812,52228,494,0001,068,0002,113,536
2Sep 17, 2026 01:413,59940,041,94728,804,0001,073,0002,113,536
3Sep 17, 2026 01:413,61040,144,99128,887,0001,079,0002,113,536
4Sep 17, 2026 01:413,61140,165,37928,915,0001,058,0002,113,536
5Sep 17, 2026 01:413,62240,256,60328,990,0001,080,0002,113,536
6Sep 17, 2026 01:413,63440,395,95429,047,0001,119,0002,113,536
7Sep 17, 2026 01:413,64040,463,07929,137,0001,083,0002,113,536
8Sep 17, 2026 01:413,64840,484,36729,172,0001,113,0002,113,536
9Sep 17, 2026 01:413,65840,557,80429,270,0001,096,0002,113,536