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:10Rajarshi BasuRajarshi BasuScore: 6,339Success
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:106,19177,357,02949,370,0002,015,0002,269,184
2Dec 6, 2025 15:096,20075,228,33050,451,0001,009,0002,289,664
3Dec 6, 2025 15:106,20383,328,95149,466,0002,019,0002,281,472
4Dec 6, 2025 15:106,21577,932,13249,559,0002,022,0002,277,376
5Dec 6, 2025 15:096,22381,278,05450,637,0001,012,0002,293,760
6Dec 6, 2025 15:096,33978,736,91351,603,0001,011,0002,289,664
7Dec 6, 2025 15:096,33980,102,70551,605,0001,011,0002,289,664
8Dec 6, 2025 15:106,34077,891,38351,610,0001,011,0002,277,376
9Dec 6, 2025 15:096,34178,233,02050,645,0001,986,0002,277,376
10Dec 6, 2025 15:106,36182,759,16850,802,0001,992,0002,289,664
11Dec 6, 2025 15:106,39277,255,78151,054,0002,002,0002,281,472
12Dec 6, 2025 15:096,44576,845,63351,478,0002,018,0002,527,232