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 15:09Victor MerckléVictor MerckléScore: 17,503Success
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 15:1217,406152,931,933138,845,0005,629,00024,576stderr
2Sep 8, 2026 15:1217,423153,175,662138,796,0005,817,00024,576stderr
3Sep 8, 2026 15:1217,489153,736,307139,413,0005,750,00024,576stderr
4Sep 8, 2026 15:1217,496154,198,946139,681,0005,539,0002,117,632stderr
5Sep 8, 2026 15:1217,503154,436,947139,738,0005,541,00024,576stderr
6Sep 8, 2026 15:1217,510153,766,551139,813,0005,524,0002,117,632stderr
7Sep 8, 2026 15:1217,530154,637,550139,926,0005,578,0002,117,632stderr
8Sep 8, 2026 15:1217,542154,742,169139,491,0006,110,0002,117,632stderr
9Sep 8, 2026 15:1217,567155,014,640140,069,0005,744,00024,576stderr