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 12, 2026 11:53Josu San MartinJosu San MartinScore: 4,160Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 11:544,12443,342,49533,189,0001,042,0002,113,536
2May 12, 2026 11:544,13041,790,07533,230,0001,051,0002,113,536
3May 12, 2026 11:544,15343,600,19933,417,0001,053,0002,113,536
4May 12, 2026 11:544,15642,783,05033,429,0001,074,0002,113,536
5May 12, 2026 11:544,16043,129,93433,484,0001,047,0002,113,536
6May 12, 2026 11:544,17041,923,07933,539,0001,073,0002,113,536
7May 12, 2026 11:544,17442,016,68733,581,0001,064,0002,113,536
8May 12, 2026 11:544,18142,775,15033,637,0001,073,0002,113,536
9May 12, 2026 11:544,19942,235,39633,779,0001,075,0002,113,536