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:10Josu 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:11049,700,87933,220,0001,110,0002,486,272expected "53686895470246591 ", got "53686894860660571 "
2May 10, 2026 05:114,09446,358,16332,872,0001,112,0002,486,272
3May 10, 2026 05:114,09849,320,62632,888,0001,127,0002,482,176
4May 10, 2026 05:114,10150,722,67032,933,0001,112,0002,490,368
5May 10, 2026 05:114,11350,261,63433,095,0001,048,0002,322,432
6May 10, 2026 05:114,12050,257,81633,157,0001,046,0002,490,368
7May 10, 2026 05:114,12151,132,55733,155,0001,051,0002,494,464
8May 10, 2026 05:114,12248,756,06233,189,0001,027,0002,478,080
9May 10, 2026 05:114,13149,280,75133,149,0001,145,0002,486,272