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:27Mikołaj UzarskiMikołaj UzarskiScore: 6,241Success
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:276,14181,563,62242,976,0007,995,0002,453,504
2Feb 19, 2026 22:276,16977,893,21045,181,0006,024,0002,293,760
3Feb 19, 2026 22:276,24181,544,29045,821,0005,976,0002,404,352
4Feb 19, 2026 22:276,24181,791,74146,820,0004,980,0002,338,816
5Feb 19, 2026 22:276,28175,802,41547,123,0005,013,0002,478,080
6Feb 19, 2026 22:276,37175,767,53745,895,0006,984,0002,269,184