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 29, 2025 22:08Alexander KovalyovAlexander KovalyovScore: 59,067Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 29, 2025 22:0859,014517,547,379485,821,0003,998,0002,260,992
2Oct 29, 2025 22:0859,034516,446,436487,987,0001,999,0002,519,040
3Oct 29, 2025 22:0859,039517,678,987490,025,00002,265,088
4Oct 29, 2025 22:0859,049521,125,818488,110,0002,000,0002,273,280
5Oct 29, 2025 22:0859,067515,492,319489,256,0001,000,0002,363,392
6Oct 29, 2025 22:0859,068516,940,754489,266,0001,000,0002,273,280
7Oct 29, 2025 22:0859,075518,808,604489,320,0001,000,0002,273,280
8Oct 29, 2025 22:0859,078516,677,203489,348,0001,000,0002,519,040
9Oct 29, 2025 22:0859,094517,713,654487,487,0002,996,0002,510,848