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 19, 2026 16:48A_ShamanA_ShamanScore: 59,022Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 16:5258,869497,821,290417,886,00070,727,0002,113,536
2Jun 19, 2026 16:5258,906498,092,722418,106,00070,815,0002,113,536
3Jun 19, 2026 16:5258,949498,443,816418,276,00071,008,0002,113,536
4Jun 19, 2026 16:5258,988498,698,557419,040,00070,566,0002,113,536
5Jun 19, 2026 16:5259,022499,112,190418,771,00071,115,0002,113,536
6Jun 19, 2026 16:5259,080499,559,617419,487,00070,884,0002,113,536
7Jun 19, 2026 16:5259,107499,680,767419,577,00071,012,0002,113,536
8Jun 19, 2026 16:5259,171500,272,087419,915,00071,206,0002,113,536
9Jun 19, 2026 16:5259,264501,560,465420,687,00071,208,0002,113,536