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 listJun 30, 2026 06:48Victor MerckléVictor MerckléScore: 5,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 06:495,42552,916,24743,912,0001,116,0002,117,632stderr
2Jun 30, 2026 06:495,43052,900,84443,961,0001,108,0002,117,632stderr
3Jun 30, 2026 06:495,43952,949,23144,035,0001,115,0002,117,632stderr
4Jun 30, 2026 06:495,45152,951,27544,201,0001,046,0002,117,632stderr
5Jun 30, 2026 06:495,45252,934,06344,246,0001,010,0002,117,632stderr
6Jun 30, 2026 06:495,45853,113,46744,205,0001,099,0002,117,632stderr
7Jun 30, 2026 06:495,46253,013,51544,228,0001,114,0002,117,632stderr
8Jun 30, 2026 06:495,48253,210,91244,473,0001,033,0002,117,632stderr
9Jun 30, 2026 06:495,65754,631,62445,929,0001,029,0002,117,632stderr