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 22, 2026 11:56Omkar SinghOmkar SinghScore: 68,065Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 11:5767,969573,456,131503,164,00060,986,0002,113,536
2Jun 22, 2026 11:5767,990573,471,868502,731,00061,594,0002,113,536
3Jun 22, 2026 11:5768,036575,035,298503,519,00061,185,0002,113,536
4Jun 22, 2026 11:5768,047574,013,733502,373,00062,420,0002,113,536
5Jun 22, 2026 11:5768,065574,398,040502,858,00062,084,0002,113,536
6Jun 22, 2026 11:5768,091574,298,217503,020,00062,136,0002,113,536
7Jun 22, 2026 11:5768,179575,226,274503,302,00062,585,0002,113,536
8Jun 22, 2026 11:5768,242575,593,268502,689,00063,727,0002,113,536
9Jun 22, 2026 11:5768,312576,166,885503,998,00062,992,0002,113,536