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 16:28Rajarshi BasuRajarshi BasuScore: 5,958Success
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 16:285,90775,229,51546,029,0003,001,0002,289,664
2Dec 6, 2025 16:285,91973,049,62547,120,0002,005,0002,289,664
3Dec 6, 2025 16:285,93369,412,88346,229,0003,014,0002,289,664
4Dec 6, 2025 16:285,93871,353,78547,271,0002,011,0002,289,664
5Dec 6, 2025 16:285,95874,742,74546,428,0003,027,0002,289,664
6Dec 6, 2025 16:285,98574,209,17748,662,0001,013,0002,289,664
7Dec 6, 2025 16:286,00077,162,14046,809,0002,987,0002,273,280
8Dec 6, 2025 16:286,00073,551,93546,810,0002,987,0002,277,376
9Dec 6, 2025 16:286,03872,533,36647,111,0003,007,0002,289,664