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 18:17Rajarshi BasuRajarshi BasuScore: 9,114Success
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 18:178,901102,138,94072,884,000998,0002,478,080
2Dec 4, 2025 18:178,911101,598,72871,966,0001,999,0002,289,664
3Dec 4, 2025 18:178,918101,345,25372,022,0002,000,0002,289,664
4Dec 4, 2025 18:179,114100,566,68774,641,0001,008,0002,498,560
5Dec 4, 2025 18:179,134102,704,62473,820,0001,995,0002,494,464
6Dec 4, 2025 18:179,134102,128,54473,818,0001,995,0002,502,656