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 24, 2026 16:32Daniel MastalerzDaniel MastalerzScore: 8,662Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 16:328,29892,351,56763,884,0004,990,0002,310,144
2Feb 24, 2026 16:328,31496,802,00165,007,0004,000,0002,519,040
3Feb 24, 2026 16:328,37892,232,61565,504,0004,031,0002,310,144
4Feb 24, 2026 16:328,66298,793,32466,902,0004,992,0002,265,088
5Feb 24, 2026 16:328,688100,012,96566,104,0006,009,0002,531,328
6Feb 24, 2026 16:329,00996,837,99367,796,0006,979,0002,297,856