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 05:38Karthik ReddyKarthik ReddyScore: 3,298Success
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 05:383,28536,270,24227,268,000020,480
2Oct 2, 2026 05:383,29036,329,61827,315,000020,480
3Oct 2, 2026 05:383,29237,995,03127,327,000020,480
4Oct 2, 2026 05:383,29536,857,13227,353,000020,480
5Oct 2, 2026 05:383,29836,414,33027,377,000020,480
6Oct 2, 2026 05:383,30136,441,39527,402,000020,480
7Oct 2, 2026 05:383,30336,497,35227,422,000020,480
8Oct 2, 2026 05:383,31736,617,82527,539,000020,480
9Oct 2, 2026 05:383,39145,549,84127,146,0001,006,00020,480