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:24Andrew EpsteinAndrew EpsteinScore: 9,929Success
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:249,82290,809,31180,520,0001,008,00024,576stderr
2Nov 3, 2026 09:249,88091,299,45582,005,000024,576stderr
3Nov 3, 2026 09:249,89291,432,61282,105,000024,576stderr
4Nov 3, 2026 09:249,92591,681,60582,385,000024,576stderr
5Nov 3, 2026 09:249,92991,738,19681,399,0001,015,00024,576stderr
6Nov 3, 2026 09:249,94393,010,78581,515,0001,020,00024,576stderr
7Nov 3, 2026 09:249,94693,001,67181,550,0001,007,00024,576stderr
8Nov 3, 2026 09:249,95293,323,29682,606,000024,576stderr
9Nov 3, 2026 09:2410,00492,411,97783,036,000024,576stderr