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 listSep 27, 2026 18:27Karthik ReddyKarthik ReddyScore: 4,961Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2026 18:294,91852,595,21939,677,0001,148,0002,113,536
2Sep 27, 2026 18:294,93251,210,62239,795,0001,148,0002,113,536
3Sep 27, 2026 18:294,93351,354,92839,817,0001,135,0002,113,536
4Sep 27, 2026 18:294,94251,290,88239,877,0001,148,0002,113,536
5Sep 27, 2026 18:294,96151,582,20640,021,0001,159,0002,113,536
6Sep 27, 2026 18:294,99951,817,61940,337,0001,155,0002,113,536
7Sep 27, 2026 18:295,02352,082,83540,543,0001,149,0002,113,536
8Sep 27, 2026 18:295,04652,136,01740,732,0001,157,0002,113,536
9Sep 27, 2026 18:295,05652,277,29340,829,0001,140,0002,113,536