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:32olliecrowolliecrowError
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:00019,782,21801,808,000303,104Exit with code 1:
2Mar 13, 2026 03:322,86353,756,74822,726,0001,033,0002,289,664
3Mar 13, 2026 03:322,88350,212,42722,929,000996,0002,277,376
4Mar 13, 2026 03:322,89149,592,62622,998,000999,0002,289,664