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 10:50Rajarshi BasuRajarshi BasuScore: 6,762Success
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 10:506,74681,841,30053,995,0001,999,0002,277,376
2Dec 6, 2025 10:506,74786,812,94254,001,0002,000,0002,289,664
3Dec 6, 2025 10:506,75181,789,19755,031,0001,000,0002,289,664
4Dec 6, 2025 10:506,75684,810,32155,071,0001,001,0002,277,376
5Dec 6, 2025 10:506,76083,493,71353,104,0003,005,0002,289,664
6Dec 6, 2025 10:506,76187,080,63655,117,0001,002,0002,289,664
7Dec 6, 2025 10:506,76286,736,04254,120,0002,004,0002,293,760
8Dec 6, 2025 10:506,76785,811,26155,163,0001,002,0002,277,376
9Dec 6, 2025 10:506,89080,794,38456,183,0001,003,0002,289,664
10Dec 6, 2025 10:506,91781,696,36556,404,0001,007,0002,273,280
11Dec 6, 2025 10:506,93185,437,23555,547,0001,983,0002,289,664
12Dec 6, 2025 10:507,03182,978,16956,343,0002,012,0002,273,280