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 15, 2026 23:07wnwnScore: 9,588Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 23:088,34994,329,25361,261,0008,034,0002,449,408
2Feb 15, 2026 23:088,46493,297,38163,226,0007,025,0002,293,760
3Feb 15, 2026 23:088,46792,898,48261,240,0009,035,0002,449,408
4Feb 15, 2026 23:078,46997,330,12562,261,0008,033,0002,473,984
5Feb 15, 2026 23:078,52797,030,83162,799,0007,974,0002,375,680
6Feb 15, 2026 23:078,59094,909,09963,263,0008,033,0002,285,568
7Feb 15, 2026 23:079,588104,930,58771,519,0008,058,0002,441,216
8Feb 15, 2026 23:079,624109,405,05670,890,0008,986,0002,498,560
9Feb 15, 2026 23:089,672109,286,01871,245,0009,031,0002,465,792
10Feb 15, 2026 23:079,677102,826,34371,282,0009,035,0002,453,504
11Feb 15, 2026 23:089,798104,733,80875,300,0006,024,0002,465,792
12Feb 15, 2026 23:089,878111,728,10673,988,0007,998,0002,469,888