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:46Daniel MastalerzDaniel MastalerzScore: 5,761Success
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:465,72275,737,15344,463,0003,031,0002,273,280
2Feb 19, 2026 22:465,74074,372,21646,629,0001,013,0002,330,624
3Feb 19, 2026 22:465,74373,629,10344,628,0003,042,0002,269,184
4Feb 19, 2026 22:465,75878,112,53445,798,0001,991,0002,269,184
5Feb 19, 2026 22:465,76076,387,19743,825,0003,984,0002,523,136
6Feb 19, 2026 22:465,76174,165,32743,831,0003,984,0002,330,624
7Feb 19, 2026 22:465,76173,986,96844,828,0002,988,0002,523,136
8Feb 19, 2026 22:465,76272,559,29843,839,0003,985,0002,523,136
9Feb 19, 2026 22:465,77472,735,39844,929,0002,995,0002,269,184
10Feb 19, 2026 22:465,84271,606,59045,461,0003,030,0002,322,432
11Feb 19, 2026 22:465,85875,350,04945,583,0003,038,0002,306,048
12Feb 19, 2026 22:465,87272,698,51644,758,0003,978,0002,289,664