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 6, 2026 10:13Kevin HeaveyKevin HeaveyScore: 3,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 10:143,51539,180,37427,930,0001,251,0002,113,536
2Sep 6, 2026 10:143,52440,067,79728,203,0001,052,0002,113,536
3Sep 6, 2026 10:143,52638,667,57828,231,0001,035,0002,113,536
4Sep 6, 2026 10:143,53738,015,55428,314,0001,048,0002,113,536
5Sep 6, 2026 10:143,53837,768,83928,309,0001,059,0002,113,536
6Sep 6, 2026 10:143,54638,028,51828,317,0001,120,0002,113,536
7Sep 6, 2026 10:143,54637,889,45128,336,0001,103,0002,113,536
8Sep 6, 2026 10:143,55338,114,03528,259,0001,234,0002,113,536
9Sep 6, 2026 10:143,57138,341,72128,548,0001,092,0002,113,536