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: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 01:063,29736,316,86627,368,000020,480
2Oct 2, 2026 01:063,30736,463,09327,456,000020,480
3Oct 2, 2026 01:063,30736,457,47027,449,000020,480
4Oct 2, 2026 01:063,31436,630,00027,510,000020,480
5Oct 2, 2026 01:063,31636,553,16027,526,000020,480
6Oct 2, 2026 01:063,31736,544,26027,536,000020,480
7Oct 2, 2026 01:063,31736,570,83327,534,000020,480
8Oct 2, 2026 01:063,32036,572,42427,558,000020,480
9Oct 2, 2026 01:063,38537,148,88627,096,0001,002,00020,480