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 listOct 29, 2025 23:54Alexander KovalyovAlexander KovalyovScore: 43,209Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 29, 2025 23:5443,187384,508,692357,452,0001,001,0002,269,184
2Oct 29, 2025 23:5443,202384,459,176357,580,000998,0002,277,376
3Oct 29, 2025 23:5443,205385,930,714357,607,000998,0002,285,568
4Oct 29, 2025 23:5443,209380,658,017356,638,0001,997,0002,285,568
5Oct 29, 2025 23:5443,209388,581,984356,636,0001,997,0002,265,088
6Oct 29, 2025 23:5443,210386,013,997357,646,000999,0002,523,136
7Oct 29, 2025 23:5443,221382,288,246356,733,0001,998,0002,285,568
8Oct 29, 2025 23:5443,222383,337,243356,745,0001,998,0002,285,568
9Oct 29, 2025 23:5443,222384,153,081356,744,0001,998,0002,265,088