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 listDec 6, 2025 15:04Rajarshi BasuRajarshi BasuScore: 6,374Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 15:046,36481,997,68849,830,0002,989,0002,289,664
2Dec 6, 2025 15:046,36577,510,79251,837,000996,0002,289,664
3Dec 6, 2025 15:046,36582,858,63050,837,0001,993,0002,289,664
4Dec 6, 2025 15:046,36778,899,92950,856,0001,994,0002,375,680
5Dec 6, 2025 15:046,37179,994,73150,886,0001,995,0002,383,872
6Dec 6, 2025 15:046,37381,385,11549,900,0002,994,0002,265,088
7Dec 6, 2025 15:046,37482,541,18951,906,000998,0002,289,664
8Dec 6, 2025 15:046,40583,269,91351,158,0002,006,0002,265,088
9Dec 6, 2025 15:046,46176,940,52652,612,0001,011,0002,289,664
10Dec 6, 2025 15:046,50383,791,25452,978,000999,0002,277,376
11Dec 6, 2025 15:046,51078,363,41451,028,0003,001,0002,273,280
12Dec 6, 2025 15:046,51084,384,39552,031,0002,001,0002,289,664