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:16A_ShamanA_ShamanScore: 48,747Success
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:1648,715414,576,058341,268,00063,072,0002,113,536
2Jun 19, 2026 16:1648,718413,562,596341,779,00062,585,0002,113,536
3Jun 19, 2026 16:1648,733413,928,824341,080,00063,407,0002,113,536
4Jun 19, 2026 16:1648,744413,728,467341,433,00063,146,0002,113,536
5Jun 19, 2026 16:1648,747413,700,721341,445,00063,156,0002,113,536
6Jun 19, 2026 16:1648,750413,798,283341,614,00063,017,0002,113,536
7Jun 19, 2026 16:1648,864414,791,775341,604,00063,970,0002,113,536
8Jun 19, 2026 16:1648,871414,712,949342,030,00063,603,0002,113,536
9Jun 19, 2026 16:1648,873414,816,632341,865,00063,783,0002,113,536