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 7, 2026 18:27Benn TanBenn TanScore: 17,102Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 18:2717,083166,346,592139,789,0001,996,0002,338,816
2Feb 7, 2026 18:2717,102168,831,782139,948,0001,999,0002,273,280
3Feb 7, 2026 18:2717,113166,988,802140,041,0002,000,0002,351,104