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 16, 2026 17:46Daniel MastalerzDaniel MastalerzScore: 7,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 17:467,46284,787,74958,937,0002,996,0002,301,952
2Feb 16, 2026 17:467,51385,412,16060,351,0002,011,0002,301,952
3Feb 16, 2026 17:467,52988,111,65759,516,0002,975,0002,514,944
4Feb 16, 2026 17:467,62287,999,48360,254,0003,012,0002,293,760
5Feb 16, 2026 17:467,65994,530,44161,554,0002,018,0002,277,376
6Feb 16, 2026 17:467,65992,289,72261,552,0002,018,0002,269,184