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 13, 2026 03:29olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Apr 27, 2026 12:00wn10.00RecheckSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 12:00015,611,06501,814,000294,912Exit with code 1:
2Mar 13, 2026 03:292,85147,632,00022,635,0001,028,0002,277,376
3Mar 13, 2026 03:292,85746,046,69522,681,0001,030,0002,289,664
4Mar 13, 2026 03:292,86756,551,88222,766,0001,034,0002,273,280
5Mar 13, 2026 03:292,87047,869,86522,783,0001,035,0002,387,968
6Mar 13, 2026 03:292,87150,048,84322,796,0001,036,0002,281,472
7Mar 13, 2026 03:292,88846,020,67921,977,0001,997,0002,289,664
8Mar 13, 2026 03:292,88846,978,82121,973,0001,997,0002,289,664
9Mar 13, 2026 03:293,30058,574,45725,284,0002,107,0002,285,568
10Mar 13, 2026 03:293,37956,012,97326,040,0002,003,0002,289,664