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 4, 2026 00:49Josu San MartinJosu San MartinScore: 5,334Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 00:505,26953,138,62040,414,0003,319,0002,113,536
2Jul 4, 2026 00:505,30453,478,34540,591,0003,437,0002,113,536
3Jul 4, 2026 00:505,32453,610,85740,747,0003,443,0002,113,536
4Jul 4, 2026 00:505,32753,679,22240,825,0003,396,0002,113,536
5Jul 4, 2026 00:505,33453,705,69640,856,0003,417,0002,113,536
6Jul 4, 2026 00:505,36253,856,80541,075,0003,437,0002,113,536
7Jul 4, 2026 00:505,39954,259,67141,338,0003,476,0002,113,536
8Jul 4, 2026 00:505,47154,870,31241,906,0003,506,0002,113,536
9Jul 4, 2026 00:506,34462,064,59349,201,0003,459,0002,113,536