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 listFeb 19, 2026 22:07Serhii SakhnoSerhii SakhnoScore: 85,555Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 22:0885,460734,783,602708,316,000999,0002,277,376
2Feb 19, 2026 22:0785,491732,284,399707,577,0001,998,0002,265,088
3Feb 19, 2026 22:0885,537733,128,224707,957,0001,999,0002,519,040
4Feb 19, 2026 22:0785,555731,970,806708,109,0002,000,0002,277,376
5Feb 19, 2026 22:0885,560745,602,469708,152,0002,000,0002,281,472
6Feb 19, 2026 22:0785,608732,819,555708,549,0001,998,0002,277,376