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 19:43Daniel MastalerzDaniel MastalerzScore: 96,320Success
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 19:4396,197827,703,933785,445,00012,990,0002,347,008
2Feb 7, 2026 19:4396,320828,934,186779,469,00019,986,0002,498,560
3Feb 7, 2026 19:4396,385826,936,276788,993,00010,999,0002,449,408