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 03:52Josu San MartinJosu San MartinScore: 4,405Success
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 03:524,39453,187,85135,392,0001,084,0002,387,968
2May 10, 2026 03:524,39653,300,04035,462,0001,027,0002,387,968
3May 10, 2026 03:524,40154,597,89835,498,0001,034,0002,379,776
4May 10, 2026 03:524,40354,247,37335,491,0001,055,0002,383,872
5May 10, 2026 03:524,40550,695,67635,396,0001,167,0002,375,680
6May 10, 2026 03:524,40849,039,52035,426,0001,167,0002,392,064
7May 10, 2026 03:524,40851,926,45135,420,0001,173,0002,392,064
8May 10, 2026 03:524,41154,366,69735,586,0001,031,0002,392,064
9May 10, 2026 03:524,41853,130,48435,535,0001,137,0002,387,968