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 3, 2026 22:03Victor MerckléVictor MerckléScore: 10,242Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 22:0310,23493,390,00883,850,0001,100,0002,117,632stderr
2Sep 3, 2026 22:0310,23694,606,78483,953,0001,014,0002,117,632stderr
3Sep 3, 2026 22:0310,24193,470,96983,903,0001,105,0002,117,632stderr
4Sep 3, 2026 22:0310,24194,147,16083,900,0001,103,0002,117,632stderr
5Sep 3, 2026 22:0310,24293,185,41783,900,0001,116,0002,117,632stderr
6Sep 3, 2026 22:0310,24593,513,14683,945,0001,093,0002,117,632stderr
7Sep 3, 2026 22:0310,25293,626,95083,954,0001,145,0002,117,632stderr
8Sep 3, 2026 22:0310,25493,525,43484,008,0001,107,0002,117,632stderr
9Sep 3, 2026 22:0310,265103,839,78984,180,0001,025,0002,117,632stderr