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 13:24Rajarshi BasuRajarshi BasuScore: 9,512Success
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 13:249,29799,891,52974,161,0003,006,0002,457,600
2Dec 4, 2025 13:249,297105,883,50375,162,0002,004,0002,289,664
3Dec 4, 2025 13:249,334101,066,41576,470,0001,006,0002,461,696
4Dec 4, 2025 13:249,512108,646,85276,954,0001,998,0002,314,240
5Dec 4, 2025 13:249,527103,604,88677,071,0002,001,0002,289,664
6Dec 4, 2025 13:249,589111,958,66678,584,0001,007,0002,289,664