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 06:47Josu 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 06:48047,927,59833,334,0001,025,0002,490,368expected "53682512896108143 ", got "53682517727898933 "
2May 10, 2026 06:484,10251,218,23132,904,0001,145,0002,494,464
3May 10, 2026 06:484,11250,523,44733,035,0001,100,0002,473,984
4May 10, 2026 06:484,11651,459,92433,125,0001,043,0002,486,272
5May 10, 2026 06:484,11853,461,18933,110,0001,070,0002,490,368
6May 10, 2026 06:484,12549,959,09333,091,0001,151,0002,486,272
7May 10, 2026 06:484,14950,248,96033,398,0001,042,0002,469,888
8May 10, 2026 06:484,15451,397,02933,419,0001,065,0002,473,984
9May 10, 2026 06:484,26352,476,86634,247,0001,141,0002,486,272