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 listJun 25, 2026 19:07Victor MerckléVictor MerckléScore: 4,696Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 19:084,68646,537,67337,804,0001,095,0002,113,536
2Jun 25, 2026 19:084,68746,419,95737,829,0001,078,0002,113,536
3Jun 25, 2026 19:084,68846,527,29737,812,0001,099,0002,113,536
4Jun 25, 2026 19:084,69546,464,00137,870,0001,104,0002,113,536
5Jun 25, 2026 19:084,69646,460,51237,868,0001,115,0002,113,536
6Jun 25, 2026 19:084,69847,771,63037,878,0001,122,0002,113,536
7Jun 25, 2026 19:084,70346,885,17637,939,0001,101,0002,113,536
8Jun 25, 2026 19:084,83847,671,78139,141,0001,016,0002,113,536
9Jun 25, 2026 19:084,93148,555,75239,906,0001,023,0002,113,536