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 15:11Rajarshi BasuRajarshi BasuScore: 8,967Success
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 15:118,775100,001,55670,839,0001,995,0002,289,664
2Dec 4, 2025 15:118,81395,205,69173,144,00002,494,464
3Dec 4, 2025 15:118,826101,611,12171,249,0002,007,0002,285,568
4Dec 4, 2025 15:118,967102,500,90173,417,0001,005,0002,342,912
5Dec 4, 2025 15:118,968103,872,90573,431,0001,005,0002,289,664
6Dec 4, 2025 15:119,136100,295,34774,835,000997,0002,289,664