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 17:13Benn TanBenn TanScore: 63,103Success
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 17:1363,086553,703,656522,612,000999,0002,396,160
2Feb 7, 2026 17:1363,103548,467,781519,758,0003,998,0002,269,184
3Feb 7, 2026 17:1363,111551,200,149520,823,0002,998,0002,269,184