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 11:50Rajarshi BasuRajarshi BasuScore: 7,156Success
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 11:506,99085,694,67756,016,0002,000,0002,289,664
2Dec 6, 2025 11:506,99987,432,14656,089,0002,003,0002,289,664
3Dec 6, 2025 11:507,01282,997,86156,196,0002,007,0002,289,664
4Dec 6, 2025 11:507,15683,670,56457,380,0002,013,0002,281,472
5Dec 6, 2025 11:507,15886,059,40957,397,0002,013,0002,301,952
6Dec 6, 2025 11:507,16381,598,82958,443,0001,007,0002,387,968