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:27A_ShamanA_ShamanScore: 69,466Success
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:2869,324584,440,156516,347,00059,048,0002,113,536
2Jun 21, 2026 20:2869,327584,427,948516,346,00059,074,0002,113,536
3Jun 21, 2026 20:2869,343584,591,209516,210,00059,341,0002,113,536
4Jun 21, 2026 20:2869,376584,958,722516,429,00059,396,0002,113,536
5Jun 21, 2026 20:2869,466585,680,408516,331,00060,242,0002,113,536
6Jun 21, 2026 20:2869,473585,793,035516,216,00060,410,0002,113,536
7Jun 21, 2026 20:2869,531586,315,976516,199,00060,912,0002,113,536
8Jun 21, 2026 20:2869,583586,640,858516,389,00061,151,0002,113,536
9Jun 21, 2026 20:2869,587586,619,872515,583,00061,997,0002,113,536