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 11:54Karthik ReddyKarthik ReddyScore: 3,253Success
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 11:543,2343,035,927,38826,849,000020,480
2Oct 2, 2026 11:543,2413,035,966,11426,903,000020,480
3Oct 2, 2026 11:543,2483,036,088,94626,961,000020,480
4Oct 2, 2026 11:543,2493,036,380,57626,968,000020,480
5Oct 2, 2026 11:543,2533,036,096,03427,002,000020,480
6Oct 2, 2026 11:543,2533,036,073,40827,001,000020,480
7Oct 2, 2026 11:543,2543,036,112,59027,012,000020,480
8Oct 2, 2026 11:543,2593,036,115,58127,050,000020,480
9Oct 2, 2026 11:543,2713,036,303,32527,153,000020,480