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 4, 2025 13:22Rajarshi BasuRajarshi BasuScore: 8,718Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2025 13:228,527101,409,78568,785,0001,993,0002,289,664
2Dec 4, 2025 13:228,532100,563,84069,818,000997,0002,469,888
3Dec 4, 2025 13:228,53797,156,53468,858,0001,995,0002,318,336
4Dec 4, 2025 13:228,71897,317,36070,353,0002,010,0002,461,696
5Dec 4, 2025 13:228,73097,876,87571,449,0001,006,0002,289,664
6Dec 4, 2025 13:228,79297,177,49170,976,0001,999,0002,334,720