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 listAug 25, 2026 02:13Victor MerckléVictor MerckléScore: 11,753Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 02:1511,665104,958,33095,696,0001,127,0002,117,632stderr
2Aug 25, 2026 02:1511,674105,039,22295,814,0001,088,0002,117,632stderr
3Aug 25, 2026 02:1511,731105,834,61996,181,0001,191,0002,117,632stderr
4Aug 25, 2026 02:1511,736105,791,14496,326,0001,089,0002,117,632stderr
5Aug 25, 2026 02:1511,753105,730,60996,406,0001,147,0002,117,632stderr
6Aug 25, 2026 02:1511,754105,918,49896,468,0001,095,0002,117,632stderr
7Aug 25, 2026 02:1511,789105,970,60196,707,0001,145,0002,117,632stderr
8Aug 25, 2026 02:1511,895107,138,60397,543,0001,186,0002,117,632stderr
9Aug 25, 2026 02:1511,917107,033,50597,806,0001,106,0002,117,632stderr