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 13:45Victor MerckléVictor MerckléScore: 3,731Success
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 13:493,61938,360,10528,432,0001,608,00024,576stderr
2Sep 8, 2026 13:493,68639,091,52828,950,0001,649,00024,576stderr
3Sep 8, 2026 13:493,71239,315,19229,260,0001,552,00024,576stderr
4Sep 8, 2026 13:493,71639,360,84629,310,0001,541,00024,576stderr
5Sep 8, 2026 13:493,73139,698,44229,348,0001,623,00024,576stderr
6Sep 8, 2026 13:493,75040,236,23829,612,0001,519,00024,576stderr
7Sep 8, 2026 13:493,75439,648,58828,848,0002,317,00024,576stderr
8Sep 8, 2026 13:493,77139,826,53229,471,0001,833,00024,576stderr
9Sep 8, 2026 13:493,79639,938,52128,848,0002,663,0002,117,632stderr