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 15:37Karthik ReddyKarthik ReddyScore: 3,245Success
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 15:383,2303,035,942,93926,815,000020,480
2Oct 2, 2026 15:383,2393,036,011,54026,889,000020,480
3Oct 2, 2026 15:383,2403,035,989,38926,892,000020,480
4Oct 2, 2026 15:383,2443,035,989,74826,930,000020,480
5Oct 2, 2026 15:383,2453,036,041,44126,934,000020,480
6Oct 2, 2026 15:383,2463,036,128,63325,928,0001,019,00020,480
7Oct 2, 2026 15:383,2493,036,046,69126,974,000020,480
8Oct 2, 2026 15:383,3163,036,626,06927,526,000020,480
9Oct 2, 2026 15:383,3573,036,903,12227,866,000020,480