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 21, 2026 15:29Juraj ZelmanJuraj ZelmanScore: 8,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 15:298,22488,228,50266,254,0002,007,0002,281,472
2Feb 21, 2026 15:298,26494,818,31567,585,0001,008,0002,285,568
3Feb 21, 2026 15:298,29096,712,01467,813,000997,0002,363,392
4Feb 21, 2026 15:298,29296,925,11767,826,000997,0002,371,584
5Feb 21, 2026 15:298,29997,318,48367,883,000998,0002,367,488
6Feb 21, 2026 15:298,312103,329,72467,988,000999,0002,473,984