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 27, 2026 02:45Victor MerckléVictor MerckléScore: 4,140Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 02:464,11642,544,60532,895,0001,270,0002,117,632stderr
2Aug 27, 2026 02:464,12242,635,61833,073,0001,147,0002,117,632stderr
3Aug 27, 2026 02:464,12742,678,46433,115,0001,141,0002,117,632stderr
4Aug 27, 2026 02:464,13342,665,96833,194,0001,111,0002,117,632stderr
5Aug 27, 2026 02:464,14042,806,55433,225,0001,137,0002,117,632stderr
6Aug 27, 2026 02:464,16043,012,98033,386,0001,150,0002,117,632stderr
7Aug 27, 2026 02:464,16542,957,08333,474,0001,099,0002,117,632stderr
8Aug 27, 2026 02:464,17043,025,38033,485,0001,133,0002,117,632stderr
9Aug 27, 2026 02:464,28944,024,99534,504,0001,100,0002,117,632stderr