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 03:48Victor MerckléVictor MerckléScore: 6,952Success
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 03:486,94967,653,13857,680,00002,113,536
2May 16, 2026 03:486,95165,460,52556,684,0001,016,0002,113,536
3May 16, 2026 03:486,95167,036,83256,687,0001,007,0002,113,536
4May 16, 2026 03:486,95166,647,19956,681,0001,020,0002,113,536
5May 16, 2026 03:486,95265,949,49257,702,00002,113,536
6May 16, 2026 03:486,95266,629,60156,672,0001,030,0002,113,536
7May 16, 2026 03:486,95466,374,95256,701,0001,018,0002,113,536
8May 16, 2026 03:486,99368,341,21957,025,0001,025,0002,113,536
9May 16, 2026 03:487,00865,565,98157,139,0001,032,0002,113,536