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 07:12Karthik ReddyKarthik ReddyScore: 3,271Success
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 07:133,26436,089,53327,092,000020,480
2Oct 2, 2026 07:133,26936,103,04527,140,000020,480
3Oct 2, 2026 07:133,27036,197,78727,143,000020,480
4Oct 2, 2026 07:133,27136,123,71827,157,000020,480
5Oct 2, 2026 07:133,27136,178,92227,154,000020,480
6Oct 2, 2026 07:133,27436,172,48027,181,000020,480
7Oct 2, 2026 07:133,27836,231,94226,211,0001,002,00020,480
8Oct 2, 2026 07:133,28436,180,59926,231,0001,029,00020,480
9Oct 2, 2026 07:133,30136,467,70326,340,0001,059,00020,480