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 listSep 8, 2026 09:12Victor MerckléVictor MerckléScore: 4,240Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 09:164,15542,981,33232,379,0002,109,0002,117,632stderr
2Sep 8, 2026 09:164,16343,062,77032,439,0002,118,00024,576stderr
3Sep 8, 2026 09:164,21743,636,42731,861,0003,148,0002,117,632stderr
4Sep 8, 2026 09:164,21744,120,55832,743,0002,263,0002,117,632stderr
5Sep 8, 2026 09:164,24043,726,67133,018,0002,174,0002,117,632stderr
6Sep 8, 2026 09:164,32344,360,28133,811,0002,074,00024,576stderr
7Sep 8, 2026 09:164,35144,594,51634,052,0002,067,00024,576stderr
8Sep 8, 2026 09:164,88051,734,41835,897,0004,612,0002,117,632stderr
9Sep 8, 2026 09:166,193128,317,76236,919,00014,491,0002,117,632stderr