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:14Rajarshi BasuRajarshi BasuScore: 6,243Success
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:146,18376,248,68149,306,0002,012,0002,277,376
2Dec 6, 2025 15:146,18676,246,96148,327,0003,020,0002,273,280
3Dec 6, 2025 15:146,18975,597,18250,361,0001,007,0002,289,664
4Dec 6, 2025 15:146,19473,715,42449,397,0002,016,0002,289,664
5Dec 6, 2025 15:146,19473,729,24150,405,0001,008,0002,289,664
6Dec 6, 2025 15:146,20471,763,25449,471,0002,019,0002,273,280
7Dec 6, 2025 15:146,24377,907,84949,827,0001,993,0002,277,376
8Dec 6, 2025 15:146,28278,719,09350,137,0002,005,0002,289,664
9Dec 6, 2025 15:146,33177,571,92051,539,0001,010,0002,273,280
10Dec 6, 2025 15:146,33783,330,30451,590,0001,011,0002,289,664
11Dec 6, 2025 15:146,34378,331,46351,639,0001,012,0002,527,232
12Dec 6, 2025 15:146,48380,302,24051,814,0001,992,0002,289,664