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 28, 2026 00:37A_ShamanA_ShamanScore: 53,550Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 00:3853,479453,157,552442,807,0001,072,0002,113,536
2Jun 28, 2026 00:3853,532453,815,213443,242,0001,076,0002,113,536
3Jun 28, 2026 00:3853,533453,892,055443,154,0001,172,0002,113,536
4Jun 28, 2026 00:3853,546453,720,763443,365,0001,068,0002,113,536
5Jun 28, 2026 00:3853,550453,772,275443,447,0001,023,0002,113,536
6Jun 28, 2026 00:3853,570453,935,115443,491,0001,148,0002,113,536
7Jun 28, 2026 00:3853,579454,035,674443,577,0001,129,0002,113,536
8Jun 28, 2026 00:3853,593454,194,486443,799,0001,027,0002,113,536
9Jun 28, 2026 00:3853,603454,419,808443,891,0001,021,0002,113,536