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:25Karthik ReddyKarthik ReddyScore: 3,265Success
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:263,2533,036,889,70527,004,000020,480
2Oct 2, 2026 15:263,2573,036,212,55027,035,000020,480
3Oct 2, 2026 15:263,2603,036,188,81927,064,000020,480
4Oct 2, 2026 15:263,2613,036,112,36827,070,000020,480
5Oct 2, 2026 15:263,2653,036,205,26727,105,000020,480
6Oct 2, 2026 15:263,2663,036,230,59827,113,000020,480
7Oct 2, 2026 15:263,2683,036,399,57027,131,000020,480
8Oct 2, 2026 15:263,2723,036,289,23927,158,000020,480
9Oct 2, 2026 15:263,2743,036,318,85527,179,000020,480