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 11, 2026 17:33Victor MerckléVictor MerckléScore: 26,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 17:3726,805235,830,465221,413,0001,073,00024,576stderr
2Sep 11, 2026 17:3726,811232,617,408221,402,0001,135,00024,576stderr
3Sep 11, 2026 17:3726,872232,449,242222,035,0001,004,00024,576stderr
4Sep 11, 2026 17:3726,873231,823,858222,035,0001,011,00024,576stderr
5Sep 11, 2026 17:3726,882233,594,346222,113,0001,014,00024,576stderr
6Sep 11, 2026 17:3726,915232,733,365222,376,0001,021,0002,117,632stderr
7Sep 11, 2026 17:3726,945232,888,254222,422,0001,227,00024,576stderr
8Sep 11, 2026 17:3726,972233,272,562222,588,0001,284,00024,576stderr
9Sep 11, 2026 17:3726,990232,854,515223,022,0001,002,00024,576stderr