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 11, 2026 01:50Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 01:51042,335,45431,252,0001,099,0002,113,536expected "53683604929267324 ", got "53683604841524395 "
2May 11, 2026 01:513,85839,891,45430,946,0001,080,0002,113,536
3May 11, 2026 01:513,88239,850,16931,146,0001,078,0002,113,536
4May 11, 2026 01:513,88941,613,07031,206,0001,079,0002,113,536
5May 11, 2026 01:513,89040,566,18531,222,0001,073,0002,113,536
6May 11, 2026 01:513,89540,020,55331,229,0001,107,0002,113,536
7May 11, 2026 01:513,90540,305,39631,336,0001,076,0002,113,536
8May 11, 2026 01:513,96740,614,43931,850,0001,077,0002,113,536
9May 11, 2026 01:513,97140,654,37231,864,0001,098,0002,113,536