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 9, 2026 20:39Daniel MastalerzDaniel MastalerzScore: 9,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2026 20:399,665106,235,33274,203,0006,016,0002,293,760
2Feb 9, 2026 20:399,691106,500,06377,420,0003,016,0002,293,760
3Feb 9, 2026 20:399,698104,227,85574,458,0006,037,0002,510,848
4Feb 9, 2026 20:399,854108,368,70079,795,0001,994,0002,387,968
5Feb 9, 2026 20:399,871105,215,43476,935,0004,995,0002,387,968
6Feb 9, 2026 20:399,931108,295,00481,422,0001,005,0002,260,992