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:44Josu 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:44052,472,04733,227,0001,170,0002,473,984expected "53687092685752192 ", got "53687092615665300 "
2May 10, 2026 05:444,09349,399,06732,863,0001,114,0002,490,368
3May 10, 2026 05:444,11550,234,54733,039,0001,122,0002,482,176
4May 10, 2026 05:444,12349,284,93733,112,0001,116,0002,502,656
5May 10, 2026 05:444,13050,385,00533,233,0001,053,0002,490,368
6May 10, 2026 05:444,13149,688,41233,246,0001,045,0002,486,272
7May 10, 2026 05:444,13248,558,56833,275,0001,021,0002,465,792
8May 10, 2026 05:444,13351,993,14733,243,0001,069,0002,490,368
9May 10, 2026 05:444,14152,111,02533,203,0001,168,0002,486,272