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 01:06Karthik ReddyKarthik ReddyScore: 3,317Success
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 01:063,29936,453,37527,387,000020,480
2Oct 2, 2026 01:063,30836,527,93627,464,000020,480
3Oct 2, 2026 01:063,31336,474,42027,499,000020,480
4Oct 2, 2026 01:063,31436,491,00027,508,000020,480
5Oct 2, 2026 01:063,31736,594,13426,516,0001,019,00020,480
6Oct 2, 2026 01:063,32236,621,33327,580,000020,480
7Oct 2, 2026 01:063,32336,646,19527,583,000020,480
8Oct 2, 2026 01:063,32936,604,16427,634,000020,480
9Oct 2, 2026 01:063,40137,250,04327,223,0001,007,00020,480