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 18, 2025 12:57Ashish AhujaAshish AhujaScore: 10,925Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 13:0410,861111,478,82983,134,0007,011,0002,347,008
2Aug 18, 2025 12:5710,864107,732,77786,168,0004,007,0002,318,336
3Aug 18, 2025 13:0410,885114,665,22083,317,0007,026,0002,371,584
4Aug 18, 2025 12:5710,906121,778,39881,564,0008,952,0002,301,952
5Aug 18, 2025 12:5710,918116,450,72582,654,0007,966,0002,285,568
6Aug 18, 2025 13:0410,923114,494,28982,691,0007,970,0002,273,280
7Aug 18, 2025 13:0410,925115,600,89383,701,0006,975,0002,363,392
8Aug 18, 2025 12:5710,935119,006,13083,777,0006,981,0002,318,336
9Aug 18, 2025 13:0410,939118,115,03984,811,0005,986,0002,396,160
10Aug 18, 2025 12:5711,024119,019,91883,543,0007,956,0002,301,952
11Aug 18, 2025 13:0411,302121,560,53087,818,0005,987,0002,273,280
12Aug 18, 2025 12:5711,372120,882,96187,361,0007,029,0002,363,392