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:51Victor MerckléVictor MerckléScore: 6,954Success
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:526,94667,168,28756,655,0001,005,0002,113,536
2May 16, 2026 05:526,94864,925,37557,676,00002,113,536
3May 16, 2026 05:526,95165,927,64857,701,00002,113,536
4May 16, 2026 05:526,95466,924,05456,714,0001,008,0002,113,536
5May 16, 2026 05:526,95468,718,94756,697,0001,022,0002,113,536
6May 16, 2026 05:526,95665,137,19556,724,0001,017,0002,113,536
7May 16, 2026 05:527,00666,422,67357,138,0001,013,0002,113,536
8May 16, 2026 05:527,08466,451,75957,783,0001,019,0002,113,536
9May 16, 2026 05:527,09868,569,54058,917,00002,113,536