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 9, 2026 08:52janwwwjanwwwScore: 5,594Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 29, 2026 22:13Andrew Epstein23.39CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 08:555,47655,870,84943,950,0001,507,0002,113,536
2Oct 9, 2026 08:555,50656,057,40444,118,0001,584,0002,113,536
3Oct 9, 2026 08:555,55256,501,82244,566,0001,522,0002,113,536
4Oct 9, 2026 08:555,58456,705,80444,839,0001,510,0002,113,536
5Oct 9, 2026 08:555,59456,777,64344,915,0001,517,0002,113,536
6Oct 9, 2026 08:555,59456,903,33944,922,0001,510,0002,113,536
7Oct 9, 2026 08:555,60558,290,56844,993,0001,529,0002,113,536
8Oct 9, 2026 08:555,61557,000,39344,922,0001,689,0002,113,536
9Oct 9, 2026 08:555,61558,366,75545,066,0001,539,0002,113,536