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 listOct 2, 2026 17:34Karthik ReddyKarthik ReddyScore: 3,697Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 17:353,6143,040,330,84826,302,0003,702,00020,480
2Oct 2, 2026 17:353,6803,039,430,63226,749,0003,803,00020,480
3Oct 2, 2026 17:353,6843,040,664,42226,699,0003,880,00020,480
4Oct 2, 2026 17:353,6963,040,859,95426,849,0003,831,00020,480
5Oct 2, 2026 17:353,6973,039,581,89026,976,0003,714,00020,480
6Oct 2, 2026 17:353,7053,039,598,49627,007,0003,746,00020,480
7Oct 2, 2026 17:353,7103,039,622,64027,164,0003,630,00020,480
8Oct 2, 2026 17:353,7363,039,799,20327,234,0003,783,00020,480
9Oct 2, 2026 17:353,7463,039,795,42927,187,0003,912,00020,480