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:18Rajarshi BasuRajarshi BasuScore: 9,010Success
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:188,806101,039,00271,090,0002,002,0002,289,664
2Dec 4, 2025 18:188,808102,832,21071,103,0002,002,0002,289,664
3Dec 4, 2025 18:188,81497,643,83972,152,0001,002,0002,498,560
4Dec 4, 2025 18:189,01098,671,47773,785,000997,0002,289,664
5Dec 4, 2025 18:189,012104,380,41174,798,00002,289,664
6Dec 4, 2025 18:189,018105,163,93472,851,0001,995,0002,486,272