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 02:28Victor MerckléVictor MerckléError
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 02:29067,084,42457,707,00002,113,536expected "53686754170943790 ", got "53686751866943790 "
2May 16, 2026 02:296,94567,001,29256,612,0001,036,0002,113,536
3May 16, 2026 02:296,94766,059,25556,626,0001,041,0002,113,536
4May 16, 2026 02:296,94965,915,69357,682,00002,113,536
5May 16, 2026 02:296,95066,708,78557,688,00002,113,536
6May 16, 2026 02:296,95367,071,23156,698,0001,012,0002,113,536
7May 16, 2026 02:296,95766,089,15256,740,0001,005,0002,113,536
8May 16, 2026 02:296,99968,129,05757,041,0001,051,0002,113,536
9May 16, 2026 02:297,10867,493,56657,999,0001,004,0002,113,536