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 listMar 27, 2025 02:04Steve BronderSteve BronderScore: 116,397Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2025 02:04116,226989,043,306962,676,0001,999,0002,531,328
2Mar 27, 2025 02:04116,229989,677,072963,705,000999,0002,531,328
3Mar 27, 2025 02:04116,294991,866,630964,239,000999,0002,531,328
4Mar 27, 2025 02:04116,350993,270,211964,705,000999,0002,531,328
5Mar 27, 2025 02:04116,3971,000,318,566965,095,0001,000,0002,428,928
6Mar 27, 2025 02:04116,416995,649,777964,256,0001,998,0002,433,024
7Mar 27, 2025 02:04116,428989,254,391964,354,0001,998,0002,531,328
8Mar 27, 2025 02:04116,444990,893,155965,486,000999,0002,437,120
9Mar 27, 2025 02:04116,460990,891,451965,615,000999,0002,531,328