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 listFeb 11, 2026 18:19olliecrowolliecrowScore: 6,481Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 18:195,91276,551,45245,065,0004,005,0002,322,432
2Feb 11, 2026 18:195,91478,461,70346,082,0003,005,0002,289,664
3Feb 11, 2026 18:195,92376,937,42448,158,0001,003,0002,260,992
4Feb 11, 2026 18:196,48179,529,01550,807,0002,988,0002,453,504
5Feb 11, 2026 18:196,52282,427,66349,210,0004,921,0002,502,656
6Feb 11, 2026 18:196,60279,637,91048,822,0005,978,0002,347,008