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 5, 2025 20:52Leon ZhaoLeon ZhaoScore: 65,160Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2025 20:5265,131571,340,023538,593,0001,998,0002,375,680
2Aug 5, 2025 20:5265,133568,243,916538,610,0001,998,0002,383,872
3Aug 5, 2025 20:5265,157565,786,411539,806,000999,0002,256,896
4Aug 5, 2025 20:5265,159572,011,682539,817,000999,0002,383,872
5Aug 5, 2025 20:5265,160567,596,960539,831,000999,0002,260,992
6Aug 5, 2025 20:5265,161565,754,609539,836,000999,0002,260,992
7Aug 5, 2025 20:5265,167567,826,119539,887,000999,0002,519,040
8Aug 5, 2025 20:5265,174575,772,028538,945,0001,999,0002,519,040
9Aug 5, 2025 20:5265,229562,972,403540,399,0001,000,0002,256,896