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 listJun 21, 2026 20:52A_ShamanA_ShamanScore: 49,753Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 20:5249,436419,589,536338,014,00072,307,0002,113,536
2Jun 21, 2026 20:5249,501420,123,280338,004,00072,862,0002,113,536
3Jun 21, 2026 20:5249,557420,547,759337,945,00073,380,0002,113,536
4Jun 21, 2026 20:5249,589420,679,260338,251,00073,339,0002,113,536
5Jun 21, 2026 20:5249,753422,060,618338,676,00074,279,0002,113,536
6Jun 21, 2026 20:5249,784422,355,068338,618,00074,591,0002,113,536
7Jun 21, 2026 20:5251,014432,544,387342,200,00081,221,0002,113,536
8Jun 21, 2026 20:5251,086433,146,337342,261,00081,753,0002,113,536
9Jun 21, 2026 20:5251,126433,474,493342,248,00082,103,0002,113,536