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:05Daniel MastalerzDaniel MastalerzScore: 5,760Success
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:055,72273,846,26846,480,0001,010,0002,392,064
2Feb 19, 2026 22:055,73176,648,83246,554,0001,012,0002,310,144
3Feb 19, 2026 22:055,73575,554,98344,560,0003,038,0002,535,424
4Feb 19, 2026 22:055,73877,587,72844,587,0003,040,0002,269,184
5Feb 19, 2026 22:055,75672,008,34944,787,0002,985,0002,330,624
6Feb 19, 2026 22:055,75874,015,72643,810,0003,982,0002,289,664
7Feb 19, 2026 22:055,76075,696,72844,822,0002,988,0002,326,528
8Feb 19, 2026 22:055,76669,271,60143,872,0003,988,0002,273,280
9Feb 19, 2026 22:055,78074,692,18445,978,0001,999,0002,269,184
10Feb 19, 2026 22:055,81573,441,24045,247,0003,016,0002,371,584
11Feb 19, 2026 22:055,84876,666,58446,517,0002,022,0002,289,664
12Feb 19, 2026 22:055,85076,384,39845,520,0003,034,0002,306,048