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 09:27Josu 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 10, 2026 09:28045,959,79933,015,0001,125,0002,482,176expected "53682772954745725 ", got "53682772896352405 "
2May 10, 2026 09:284,12051,299,03933,136,0001,067,0002,473,984
3May 10, 2026 09:284,12850,392,83733,211,0001,059,0002,486,272
4May 10, 2026 09:284,13049,969,97033,215,0001,069,0002,482,176
5May 10, 2026 09:284,13650,954,02733,280,0001,053,0002,486,272
6May 10, 2026 09:284,14050,754,04333,310,0001,056,0002,490,368
7May 10, 2026 09:284,14450,844,03633,324,0001,076,0002,490,368
8May 10, 2026 09:284,14846,500,93833,356,0001,073,0002,482,176
9May 10, 2026 09:284,15650,285,03533,386,0001,112,0002,490,368