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:00Rajarshi BasuRajarshi BasuScore: 7,756Success
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:007,59589,227,85961,038,0002,001,0002,379,776
2Dec 6, 2025 15:007,59693,416,10161,043,0002,001,0002,289,664
3Dec 6, 2025 15:007,59988,745,82562,073,0001,001,0002,289,664
4Dec 6, 2025 15:007,75687,227,38862,366,0002,011,0002,289,664
5Dec 6, 2025 15:007,76389,186,52662,422,0002,013,0002,289,664
6Dec 6, 2025 15:007,76390,734,94462,417,0002,013,0002,289,664