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 25, 2026 20:49Maya RebholzMaya RebholzScore: 5,996Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 20:505,76359,333,95842,688,0005,145,0002,117,632
2May 25, 2026 20:505,92158,739,58043,710,0005,437,0002,117,632
3May 25, 2026 20:505,92359,052,95043,681,0005,487,0002,117,632
4May 25, 2026 20:505,94861,175,17843,764,0005,607,0002,113,536
5May 25, 2026 20:505,99662,022,22144,196,0005,572,0002,113,536
6May 25, 2026 20:506,00159,723,38244,210,0005,603,0002,113,536
7May 25, 2026 20:506,02860,643,22444,365,0005,673,0002,117,632
8May 25, 2026 20:506,05660,260,86444,422,0005,845,0002,113,536
9May 25, 2026 20:506,19963,213,07545,855,0005,598,0002,117,632