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:31Daniel MastalerzDaniel MastalerzScore: 6,291Success
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:316,18174,682,27848,282,0003,017,0002,314,240
2Feb 19, 2026 22:316,20874,045,87547,482,0004,041,0002,269,184
3Feb 19, 2026 22:316,20978,051,81948,500,0003,031,0002,338,816
4Feb 19, 2026 22:316,29178,845,91648,199,0004,016,0002,273,280
5Feb 19, 2026 22:316,30777,844,92148,324,0004,027,0002,330,624
6Feb 19, 2026 22:316,31079,320,08648,348,0004,029,0002,273,280