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 5, 2025 06:16Rajarshi BasuRajarshi BasuScore: 1,089,329Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2025 06:161,082,3459,016,197,7658,983,463,00002,281,472
2Dec 5, 2025 06:161,089,3299,068,970,0729,039,433,0001,999,0002,289,664
3Dec 5, 2025 06:161,090,5089,081,865,2779,049,215,0001,998,0002,285,568