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 12:04Rajarshi BasuRajarshi BasuScore: 6,961Success
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 12:046,80183,701,93754,433,0002,016,0002,277,376
2Dec 6, 2025 12:046,81079,850,70954,503,0002,018,0002,269,184
3Dec 6, 2025 12:046,81984,315,74255,587,0001,010,0002,289,664
4Dec 6, 2025 12:046,96192,342,41256,778,000996,0002,281,472
5Dec 6, 2025 12:046,96487,538,12755,807,0001,993,0002,281,472
6Dec 6, 2025 12:046,97183,786,67655,865,0001,995,0002,289,664