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 listJul 2, 2026 18:51A_ShamanA_ShamanScore: 38,104Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 18:5138,091326,240,257314,087,0002,074,0002,113,536
2Jul 2, 2026 18:5138,095326,289,237314,154,0002,040,0002,113,536
3Jul 2, 2026 18:5138,096326,226,108314,197,0002,003,0002,113,536
4Jul 2, 2026 18:5138,098326,264,372314,209,0002,010,0002,113,536
5Jul 2, 2026 18:5138,104326,298,014314,261,0002,003,0002,113,536
6Jul 2, 2026 18:5138,116326,415,458314,357,0002,011,0002,113,536
7Jul 2, 2026 18:5138,120326,494,036314,345,0002,054,0002,113,536
8Jul 2, 2026 18:5138,125327,339,042315,434,0001,004,0002,113,536
9Jul 2, 2026 18:5138,134326,544,254314,449,0002,070,0002,113,536