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 16:51Victor MerckléVictor MerckléScore: 14,469Success
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 16:5313,818123,741,465113,689,0001,008,0002,113,536
2Aug 27, 2026 16:5314,309127,217,941117,761,0001,007,0002,113,536
3Aug 27, 2026 16:5314,364127,616,837118,218,0001,008,0002,113,536
4Aug 27, 2026 16:5314,456128,998,762118,981,0001,007,0002,113,536
5Aug 27, 2026 16:5314,469128,539,445119,087,0001,007,0002,113,536
6Aug 27, 2026 16:5314,484129,200,317119,210,0001,009,0002,113,536
7Aug 27, 2026 16:5314,495128,884,803119,304,0001,008,0002,113,536
8Aug 27, 2026 16:5314,504128,774,227119,378,0001,007,0002,113,536
9Aug 27, 2026 16:5314,737131,373,417121,315,0001,008,0002,113,536