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 11, 2025 15:27Bernard TeoBernard TeoScore: 6,519Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2025 15:276,50379,290,35252,973,000999,0002,273,280
2Dec 11, 2025 15:276,51377,105,60453,055,0001,001,0002,396,160
3Dec 11, 2025 15:276,51583,616,62152,071,0002,002,0002,273,280
4Dec 11, 2025 15:276,51976,628,45752,104,0002,004,0002,408,448
5Dec 11, 2025 15:276,52475,241,36052,146,0002,005,0002,273,280
6Dec 11, 2025 15:276,53780,597,53252,249,0002,009,0002,273,280