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 listDec 5, 2025 03:54warshipwarshipScore: 108,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2025 03:53107,708919,469,087649,258,000244,720,0002,277,376
2Dec 5, 2025 03:53107,750916,654,611638,516,000255,806,0002,277,376
3Dec 5, 2025 03:54107,832922,631,526644,287,000250,722,0002,453,504
4Dec 5, 2025 03:53108,011918,303,703646,632,000249,858,0002,519,040
5Dec 5, 2025 03:54108,020926,075,852651,688,000244,882,0002,277,376
6Dec 5, 2025 03:54108,184925,103,352641,234,000256,693,0002,506,752