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 17, 2026 22:19Daniel MastalerzDaniel MastalerzScore: 6,655Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 22:196,51180,427,85851,039,0003,002,0002,301,952
2Feb 17, 2026 22:196,52473,370,80451,142,0003,008,0002,301,952
3Feb 17, 2026 22:196,56080,420,44152,431,0002,016,0002,277,376
4Feb 17, 2026 22:196,65580,975,50152,221,0003,012,0002,293,760
5Feb 17, 2026 22:196,65783,436,68953,242,0002,009,0002,383,872
6Feb 17, 2026 22:196,65882,996,67253,250,0002,009,0002,273,280