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 21, 2026 11:54olliecrowolliecrowScore: 6,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 11:536,07474,636,75347,387,0003,024,0002,453,504
2Mar 21, 2026 11:526,11776,526,21447,787,0002,986,0002,457,600
3Mar 21, 2026 11:536,12177,782,99247,813,0002,988,0002,301,952
4Mar 21, 2026 11:536,12280,483,75244,833,0005,977,0002,428,928
5Mar 21, 2026 11:546,12580,414,80747,847,0002,990,0002,478,080
6Mar 21, 2026 11:536,14673,373,96848,010,0003,000,0002,437,120
7Mar 21, 2026 11:526,15978,419,38047,114,0004,009,0002,486,272
8Mar 21, 2026 11:546,16173,366,29747,126,0004,010,0002,482,176
9Mar 21, 2026 11:526,16475,910,58849,152,0002,006,0002,342,912
10Mar 21, 2026 11:546,16574,367,62548,163,0003,010,0002,400,256
11Mar 21, 2026 11:536,19778,076,69847,403,0004,034,0002,461,696
12Mar 21, 2026 11:536,20675,949,37048,480,0003,030,0002,396,160