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 21, 2026 18:09Daniel MastalerzDaniel MastalerzScore: 5,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 21, 2026 18:105,54571,498,90742,025,0004,002,0002,265,088
2Feb 21, 2026 18:105,54772,133,88242,041,0004,003,0002,523,136
3Feb 21, 2026 18:095,55175,733,28342,071,0004,006,0002,265,088
4Feb 21, 2026 18:105,56767,344,75442,186,0004,017,0002,523,136
5Feb 21, 2026 18:095,58169,222,25142,294,0004,028,0002,269,184
6Feb 21, 2026 18:095,58572,078,02244,340,0002,015,0002,265,088
7Feb 21, 2026 18:105,64471,048,11343,858,0002,990,0002,269,184
8Feb 21, 2026 18:105,64674,728,38742,876,0003,988,0002,260,992
9Feb 21, 2026 18:095,64770,417,85142,880,0003,988,0002,273,280
10Feb 21, 2026 18:095,65173,475,65043,844,0003,058,0002,269,184
11Feb 21, 2026 18:095,69468,756,74044,245,0003,016,0002,387,968
12Feb 21, 2026 18:106,01372,944,47145,916,0003,992,0002,260,992