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 5, 2026 14:05M-RochatM-RochatScore: 20,114Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 14:1220,020183,781,663165,051,0001,122,0002,473,984
2May 5, 2026 14:1220,053184,458,313165,301,0001,141,0002,478,080
3May 5, 2026 14:1220,071182,843,690165,458,0001,134,0002,469,888
4May 5, 2026 14:1220,084185,867,332165,555,0001,150,0002,465,792
5May 5, 2026 14:1220,114182,729,536165,807,0001,141,0002,461,696
6May 5, 2026 14:1220,180183,777,278166,386,0001,108,0002,486,272
7May 5, 2026 14:1220,194185,747,231166,439,0001,172,0002,465,792
8May 5, 2026 14:1220,329184,135,569167,587,0001,149,0002,469,888
9May 5, 2026 14:1220,843187,092,338171,863,0001,136,0002,461,696