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 listMay 16, 2026 05:15Victor MerckléVictor MerckléScore: 6,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 05:166,95065,445,72357,692,00002,113,536
2May 16, 2026 05:166,95066,635,11157,691,00002,113,536
3May 16, 2026 05:166,95067,326,34156,686,0001,004,0002,113,536
4May 16, 2026 05:166,95166,341,33957,698,00002,113,536
5May 16, 2026 05:166,95665,085,23056,729,0001,007,0002,113,536
6May 16, 2026 05:166,95867,874,48456,718,0001,034,0002,113,536
7May 16, 2026 05:166,96266,772,33357,785,00002,113,536
8May 16, 2026 05:166,96765,216,78256,810,0001,021,0002,113,536
9May 16, 2026 05:167,01970,949,77857,228,0001,034,0002,113,536