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 listFeb 15, 2026 23:15wnwnScore: 8,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 23:157,46285,604,88154,943,0006,992,0002,428,928
2Feb 15, 2026 23:157,50887,313,04656,286,0006,030,0002,387,968
3Feb 15, 2026 23:157,56692,189,07853,826,0008,971,0002,465,792
4Feb 15, 2026 23:158,705100,872,16862,215,00010,034,0002,281,472
5Feb 15, 2026 23:158,866100,526,38865,521,0008,064,0002,461,696
6Feb 15, 2026 23:158,96497,499,95767,361,0007,037,0002,506,752