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:34Rajarshi BasuRajarshi BasuScore: 8,386Success
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:348,19694,624,15867,028,0001,000,0002,289,664
2Dec 4, 2025 13:348,26095,816,02267,561,000993,0002,486,272
3Dec 4, 2025 13:348,311103,064,66367,983,000999,0002,490,368
4Dec 4, 2025 13:348,386100,189,53468,597,0001,008,0002,289,664
5Dec 4, 2025 13:348,39097,952,86468,631,0001,009,0002,289,664
6Dec 4, 2025 13:348,45092,674,00268,133,0002,003,0002,281,472