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 1, 2026 17:07Karthik ReddyKarthik ReddyScore: 3,310Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 17:073,29736,364,23127,370,000020,480
2Oct 1, 2026 17:073,30336,443,59327,418,000020,480
3Oct 1, 2026 17:073,30536,470,06727,432,000020,480
4Oct 1, 2026 17:073,30836,478,64827,458,000020,480
5Oct 1, 2026 17:073,31036,494,36627,478,000020,480
6Oct 1, 2026 17:073,31436,501,39927,513,000020,480
7Oct 1, 2026 17:073,31838,342,10027,541,000020,480
8Oct 1, 2026 17:073,33336,722,15526,645,0001,020,00020,480
9Oct 1, 2026 17:073,43737,514,19628,534,000020,480