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 3, 2025 14:25Rajarshi BasuRajarshi BasuScore: 12,046Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2025 14:2511,795124,261,40394,904,0002,996,0002,494,464
2Dec 3, 2025 14:2511,820120,543,77892,102,0006,006,0002,486,272
3Dec 3, 2025 14:2511,822121,257,77295,118,0003,003,0002,281,472
4Dec 3, 2025 14:2512,046126,042,70498,985,000999,0002,281,472
5Dec 3, 2025 14:2512,069127,193,79598,171,0002,003,0002,490,368
6Dec 3, 2025 14:2512,073122,165,51598,198,0002,004,0002,490,368