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:54A_ShamanA_ShamanScore: 48,114Success
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:5447,990407,669,027315,514,00082,811,0002,113,536
2Jun 19, 2026 16:5448,002407,555,338315,444,00082,979,0002,113,536
3Jun 19, 2026 16:5448,013407,543,972315,651,00082,863,0002,113,536
4Jun 19, 2026 16:5448,031407,767,794315,483,00083,181,0002,113,536
5Jun 19, 2026 16:5448,114408,704,569314,971,00084,378,0002,113,536
6Jun 19, 2026 16:5448,128408,924,347315,247,00084,222,0002,113,536
7Jun 19, 2026 16:5448,134408,670,967315,008,00084,506,0002,113,536
8Jun 19, 2026 16:5448,536412,299,888316,888,00085,965,0002,113,536
9Jun 19, 2026 16:5448,900416,011,743317,361,00088,513,0002,113,536