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 07:22Josu 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 07:22051,145,68433,564,0001,022,0002,490,368expected "53692946797470074 ", got "53692954776724526 "
2May 10, 2026 07:224,13347,526,95533,183,0001,126,0002,490,368
3May 10, 2026 07:224,13650,198,30733,193,0001,142,0002,482,176
4May 10, 2026 07:224,14651,845,00333,273,0001,142,0002,486,272
5May 10, 2026 07:224,15250,540,82233,350,0001,117,0002,473,984
6May 10, 2026 07:224,15350,469,21033,308,0001,165,0002,482,176
7May 10, 2026 07:224,15750,349,16333,437,0001,074,0002,486,272
8May 10, 2026 07:224,16248,431,73133,426,0001,126,0002,482,176
9May 10, 2026 07:224,20651,934,52333,829,0001,083,0002,494,464