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 listJul 7, 2026 12:54Kevin HeaveyKevin HeaveyScore: 8,260Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 12:558,23777,918,22967,109,0001,266,0002,117,632
2Jul 7, 2026 12:558,24578,040,95767,195,0001,242,0002,117,632
3Jul 7, 2026 12:558,25778,074,67967,317,0001,217,0002,117,632
4Jul 7, 2026 12:558,25778,125,48267,287,0001,251,0002,117,632
5Jul 7, 2026 12:558,26078,179,31467,319,0001,242,0002,117,632
6Jul 7, 2026 12:558,28178,386,13467,517,0001,218,0002,117,632
7Jul 7, 2026 12:558,29278,400,06567,660,0001,167,0002,117,632
8Jul 7, 2026 12:558,30278,523,15867,668,0001,239,0002,117,632
9Jul 7, 2026 12:558,35678,959,41768,118,0001,238,0002,117,632