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 17:08Juraj ZelmanJuraj ZelmanScore: 7,166Success
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 17:087,08084,166,17956,776,0001,992,0002,355,200
2Feb 21, 2026 17:087,11385,173,17858,041,0001,000,0002,355,200
3Feb 21, 2026 17:087,11779,370,29057,068,0002,002,0002,281,472
4Feb 21, 2026 17:087,12381,983,06457,118,0002,004,0002,359,296
5Feb 21, 2026 17:087,12382,194,55857,119,0002,004,0002,289,664
6Feb 21, 2026 17:087,12481,906,69958,127,0001,002,0002,359,296
7Feb 21, 2026 17:087,16684,384,24759,481,00002,355,200
8Feb 21, 2026 17:087,17082,025,36859,513,00002,293,760
9Feb 21, 2026 17:087,17784,882,89659,565,00002,293,760
10Feb 21, 2026 17:087,21190,826,36358,854,000997,0002,293,760
11Feb 21, 2026 17:087,24783,201,36359,151,0001,002,0002,437,120
12Feb 21, 2026 17:087,35884,445,21960,072,0001,001,0002,277,376