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 18, 2026 23:04Josu San MartinJosu San MartinScore: 6,644Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 23:046,24076,603,81550,797,000996,0002,428,928
2Feb 18, 2026 23:046,28875,702,28449,177,0003,010,0002,473,984
3Feb 18, 2026 23:046,29777,616,60851,258,0001,005,0002,273,280
4Feb 18, 2026 23:046,64493,382,38750,136,0005,013,0002,281,472
5Feb 18, 2026 23:046,72682,814,37254,833,000996,0002,519,040
6Feb 18, 2026 23:046,75886,052,98254,092,0002,003,0002,338,816