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 07:03Rajarshi BasuRajarshi BasuScore: 2,433,278Success
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 07:032,430,06820,204,814,61820,165,570,0003,998,0002,482,176
2Dec 5, 2025 07:032,433,27820,233,357,07920,195,207,000999,0002,289,664
3Dec 5, 2025 07:032,438,82720,279,289,63220,240,266,0001,999,0002,289,664