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 06:05Karthik ReddyKarthik ReddyScore: 3,316Success
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 06:063,31036,400,73026,380,0001,096,00020,480
2Oct 2, 2026 06:063,31336,602,37926,359,0001,141,00020,480
3Oct 2, 2026 06:063,31336,573,72226,396,0001,107,00020,480
4Oct 2, 2026 06:063,31436,531,26626,414,0001,099,00020,480
5Oct 2, 2026 06:063,31636,573,88826,399,0001,130,00020,480
6Oct 2, 2026 06:063,31636,444,98526,367,0001,160,00020,480
7Oct 2, 2026 06:063,31736,437,38626,435,0001,101,00020,480
8Oct 2, 2026 06:063,36737,623,39126,926,0001,024,00020,480
9Oct 2, 2026 06:063,38537,131,59926,968,0001,135,00020,480