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:49Omkar SinghOmkar SinghScore: 74,735Success
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:5174,557627,904,927508,714,000110,113,0002,113,536
2Jun 22, 2026 11:5174,585628,234,421510,369,000108,687,0002,113,536
3Jun 22, 2026 11:5174,594628,382,880510,353,000108,778,0002,113,536
4Jun 22, 2026 11:5174,674629,095,377508,796,000111,004,0002,113,536
5Jun 22, 2026 11:5174,735629,436,530510,177,000110,126,0002,113,536
6Jun 22, 2026 11:5174,852630,774,143511,697,000109,580,0002,113,536
7Jun 22, 2026 11:5174,873630,671,963510,625,000110,823,0002,113,536
8Jun 22, 2026 11:5175,070632,340,052510,608,000112,476,0002,113,536
9Jun 22, 2026 11:5175,377636,867,617512,248,000113,386,0002,113,536