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 11:18Rajarshi BasuRajarshi BasuScore: 6,963Success
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 11:186,79785,251,27554,404,0002,014,0002,289,664
2Dec 6, 2025 11:186,80083,564,41856,436,00002,289,664
3Dec 6, 2025 11:056,82489,771,64055,628,0001,011,0002,289,664
4Dec 6, 2025 11:056,86983,863,54155,015,0002,000,0002,289,664
5Dec 6, 2025 11:186,91578,012,69855,381,0002,013,0002,289,664
6Dec 6, 2025 11:056,95188,842,44956,678,0001,012,0002,289,664
7Dec 6, 2025 11:056,96386,608,91054,803,0002,989,0002,289,664
8Dec 6, 2025 11:056,96683,841,59655,824,0001,993,0002,289,664
9Dec 6, 2025 11:186,96789,782,08454,838,0002,991,0002,265,088
10Dec 6, 2025 11:186,96787,285,85955,829,0001,993,0002,371,584
11Dec 6, 2025 11:186,97084,078,74556,837,0001,014,0002,289,664
12Dec 6, 2025 11:056,97886,613,21054,924,0002,995,0002,289,664