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 listSep 17, 2026 13:50Andrew EpsteinAndrew EpsteinScore: 10,280Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 14:1510,09792,556,81182,738,0001,073,0002,117,632stderr
2Sep 17, 2026 14:1510,16393,201,38783,304,0001,056,0002,117,632stderr
3Sep 17, 2026 14:1510,25993,905,51584,075,0001,078,0002,117,632stderr
4Sep 17, 2026 14:1510,27694,009,46784,229,0001,069,0002,117,632stderr
5Sep 17, 2026 14:1510,28094,065,19484,262,0001,070,0002,117,632stderr
6Sep 17, 2026 14:1510,30494,241,55084,458,0001,068,0002,117,632stderr
7Sep 17, 2026 14:1510,33995,186,67884,753,0001,068,0002,117,632stderr
8Sep 17, 2026 14:1510,826106,834,54488,737,0001,127,0002,117,632stderr
9Sep 17, 2026 14:1511,034108,455,53590,458,0001,125,0002,117,632stderr