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 05:03Josu 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 05:03050,817,40233,706,0001,075,0002,473,984expected "53689188443823887 ", got "53689186391720816 "
2May 10, 2026 05:034,14150,238,73333,345,0001,027,0002,482,176
3May 10, 2026 05:034,14552,461,25333,346,0001,063,0002,486,272
4May 10, 2026 05:034,14851,703,83933,381,0001,049,0002,490,368
5May 10, 2026 05:034,15252,315,83733,394,0001,068,0002,478,080
6May 10, 2026 05:034,15449,716,91633,403,0001,080,0002,473,984
7May 10, 2026 05:034,15652,916,45333,364,0001,139,0002,486,272
8May 10, 2026 05:034,17952,212,17633,624,0001,066,0002,473,984
9May 10, 2026 05:034,19051,364,19933,542,0001,240,0002,490,368