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:32Omkar SinghOmkar SinghScore: 108,261Success
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:32107,556901,853,076722,629,000170,088,0002,113,536
2Jun 22, 2026 11:32107,721903,271,369719,947,000174,141,0002,113,536
3Jun 22, 2026 11:32107,767903,718,698721,086,000173,381,0002,113,536
4Jun 22, 2026 11:32107,922905,309,005723,491,000172,262,0002,113,536
5Jun 22, 2026 11:32108,261908,287,304724,228,000174,345,0002,113,536
6Jun 22, 2026 11:32108,288918,092,281722,713,000176,083,0002,117,632
7Jun 22, 2026 11:32108,379909,127,034725,247,000174,303,0002,113,536
8Jun 22, 2026 11:32108,386908,719,620722,559,000177,052,0002,113,536
9Jun 22, 2026 11:32108,512910,177,483723,212,000177,439,0002,113,536