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 listAug 8, 2025 02:23Leon ZhaoLeon ZhaoScore: 30,978Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 8, 2025 02:2330,860288,199,049254,141,0002,001,0002,265,088
2Aug 8, 2025 02:2330,962285,037,984254,984,0001,999,0002,265,088
3Aug 8, 2025 02:2330,964281,991,192255,000,0002,000,0002,392,064
4Aug 8, 2025 02:2330,964283,018,083256,003,0001,000,0002,285,568
5Aug 8, 2025 02:2330,978283,134,146256,114,0001,000,0002,273,280
6Aug 8, 2025 02:2330,979286,719,618255,126,0002,000,0002,285,568
7Aug 8, 2025 02:2330,984280,803,518255,168,0002,001,0002,523,136
8Aug 8, 2025 02:2330,995278,978,695256,256,0001,001,0002,379,776
9Aug 8, 2025 02:2330,998289,218,352255,280,0002,002,0002,367,488