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 listNov 3, 2026 09:25Andrew EpsteinAndrew EpsteinScore: 9,928Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 09:259,86096,254,00680,828,0001,014,00024,576stderr
2Nov 3, 2026 09:259,88596,479,64581,033,0001,017,00024,576stderr
3Nov 3, 2026 09:259,89796,739,46882,146,000024,576stderr
4Nov 3, 2026 09:259,92396,829,84981,361,0001,007,00024,576stderr
5Nov 3, 2026 09:259,92896,776,44282,403,000024,576stderr
6Nov 3, 2026 09:259,94296,974,33081,512,0001,014,00024,576stderr
7Nov 3, 2026 09:259,95197,008,13381,574,0001,026,00024,576stderr
8Nov 3, 2026 09:259,97297,429,78581,763,0001,005,00024,576stderr
9Nov 3, 2026 09:2510,02597,593,51383,209,000024,576stderr