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 10, 2026 19:35Daniel MastalerzDaniel MastalerzScore: 10,261Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 19:3510,076107,963,05780,611,0003,022,0002,273,280
2Feb 10, 2026 19:3510,092109,208,82579,775,0003,988,0002,326,528
3Feb 10, 2026 19:3510,107109,887,45680,892,0002,996,0002,326,528
4Feb 10, 2026 19:3510,261110,249,31481,162,0004,008,0002,310,144
5Feb 10, 2026 19:3510,288108,849,29081,371,0004,018,0002,310,144
6Feb 10, 2026 19:3510,309113,547,43482,547,0003,020,0002,322,432