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:03Rajarshi BasuRajarshi BasuScore: 6,404Success
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:036,37478,847,80650,907,0001,996,0002,277,376
2Dec 6, 2025 15:036,37878,454,05750,944,0001,997,0002,400,256
3Dec 6, 2025 15:036,38377,764,26851,978,000999,0002,265,088
4Dec 6, 2025 15:036,38477,461,54850,990,0001,999,0002,289,664
5Dec 6, 2025 15:036,39377,786,75651,056,0002,002,0002,527,232
6Dec 6, 2025 15:036,40385,142,88452,140,0001,002,0002,289,664
7Dec 6, 2025 15:036,40480,301,21851,150,0002,005,0002,289,664
8Dec 6, 2025 15:036,45881,945,99352,589,0001,011,0002,289,664
9Dec 6, 2025 15:036,50781,943,94852,009,0002,000,0002,289,664
10Dec 6, 2025 15:036,52480,166,86352,148,0002,005,0002,289,664
11Dec 6, 2025 15:036,53478,192,17453,231,0001,004,0002,289,664
12Dec 6, 2025 15:036,54475,038,74451,295,0003,017,0002,289,664