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:23Victor MerckléVictor MerckléScore: 6,951Success
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:236,94966,449,16656,667,0001,016,0002,113,536
2May 16, 2026 03:236,95066,808,08756,648,0001,044,0002,113,536
3May 16, 2026 03:236,95065,025,76256,646,0001,043,0002,113,536
4May 16, 2026 03:236,95067,691,81757,693,00002,113,536
5May 16, 2026 03:236,95165,151,95457,694,00002,113,536
6May 16, 2026 03:236,97165,589,34057,860,00002,113,536
7May 16, 2026 03:237,00567,101,08358,149,00002,113,536
8May 16, 2026 03:237,00668,490,05157,144,0001,008,0002,113,536
9May 16, 2026 03:237,00667,916,12457,141,0001,009,0002,113,536