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 15, 2026 13:33Daniel MastalerzDaniel MastalerzScore: 6,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 13:336,48277,216,55949,818,0003,985,0002,310,144
2Feb 15, 2026 13:336,49476,863,51950,904,0002,994,0002,326,528
3Feb 15, 2026 13:336,49577,024,84549,919,0003,993,0002,310,144
4Feb 15, 2026 13:336,61177,961,10450,884,0003,990,0002,318,336
5Feb 15, 2026 13:336,61681,517,99351,918,0002,995,0002,318,336
6Feb 15, 2026 13:336,62480,773,87551,980,0002,998,0002,273,280