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 17, 2026 11:00DavidDavidScore: 41,281Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 11:0041,259351,518,756341,446,0001,007,0002,113,536
2Jun 17, 2026 11:0041,264351,546,624341,488,0001,004,0002,113,536
3Jun 17, 2026 11:0041,277351,641,371341,597,0001,004,0002,113,536
4Jun 17, 2026 11:0041,280351,664,833341,627,0001,005,0002,113,536
5Jun 17, 2026 11:0041,281351,642,985341,630,0001,005,0002,113,536
6Jun 17, 2026 11:0041,282351,740,285341,644,0001,003,0002,113,536
7Jun 17, 2026 11:0041,284352,185,351341,654,0001,004,0002,113,536
8Jun 17, 2026 11:0041,290351,751,018341,707,0001,005,0002,113,536
9Jun 17, 2026 11:0041,302351,896,929341,802,0001,005,0002,113,536