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 27, 2025 11:04Weitao WanWeitao WanScore: 39,061Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 27, 2025 11:0439,040346,714,370323,032,0001,000,0002,289,664
2Oct 27, 2025 11:0439,052345,649,163322,129,0002,000,0002,289,664
3Oct 27, 2025 11:0439,053350,353,175322,142,0002,000,0002,269,184
4Oct 27, 2025 11:0439,054347,354,676323,152,0001,000,0002,289,664
5Oct 27, 2025 11:0439,061347,150,625322,203,0002,001,0002,265,088
6Oct 27, 2025 11:0439,070350,051,197322,282,0002,001,0002,289,664
7Oct 27, 2025 11:0439,080346,213,163323,361,0001,001,0002,514,944
8Oct 27, 2025 11:0439,082346,474,736323,378,0001,001,0002,281,472
9Oct 27, 2025 11:0439,090350,985,803324,443,00002,269,184