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 listMay 10, 2026 02:29Josu San MartinJosu San MartinScore: 4,833Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 02:294,71752,429,66638,102,0001,054,0002,469,888
2May 10, 2026 02:294,75556,666,99438,437,0001,030,0002,473,984
3May 10, 2026 02:294,80253,638,96938,804,0001,053,0002,473,984
4May 10, 2026 02:294,83157,121,83639,045,0001,053,0002,473,984
5May 10, 2026 02:294,83352,715,18139,062,0001,053,0002,473,984
6May 10, 2026 02:294,87354,593,00039,418,0001,029,0002,473,984
7May 10, 2026 02:294,88157,109,22639,488,0001,028,0002,473,984
8May 10, 2026 02:295,08258,332,27841,156,0001,027,0002,469,888
9May 10, 2026 02:295,08759,358,84941,194,0001,036,0002,482,176