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 5, 2026 01:44FrederickFrederickScore: 8,726Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Nov 6, 2026 00:21Andrew Epstein10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 01:448,52281,688,68968,655,0002,078,0002,117,632
2Oct 5, 2026 01:448,52481,355,68368,701,0002,056,0002,117,632
3Oct 5, 2026 01:448,69082,958,09870,052,0002,082,0002,117,632
4Oct 5, 2026 01:448,69782,691,79470,094,0002,096,0002,117,632
5Oct 5, 2026 01:448,72683,272,96170,282,0002,150,0002,113,536
6Oct 5, 2026 01:448,75183,795,88170,567,0002,073,0002,117,632
7Oct 5, 2026 01:448,78484,072,53670,832,0002,082,0002,117,632
8Oct 5, 2026 01:448,88084,897,51071,624,0002,082,0002,117,632
9Oct 5, 2026 01:448,88184,160,47971,576,0002,142,0002,117,632