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:08Karthik ReddyKarthik ReddyScore: 3,254Success
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:093,2393,035,873,75626,885,000020,480
2Oct 2, 2026 15:093,2433,036,064,89026,925,000020,480
3Oct 2, 2026 15:093,2503,036,010,54625,969,0001,008,00020,480
4Oct 2, 2026 15:093,2503,035,968,97426,979,000020,480
5Oct 2, 2026 15:093,2543,036,104,08927,015,000020,480
6Oct 2, 2026 15:093,2573,036,198,73527,038,000020,480
7Oct 2, 2026 15:093,2603,036,165,43527,060,000020,480
8Oct 2, 2026 15:093,2693,036,195,60727,140,000020,480
9Oct 2, 2026 15:093,3143,038,308,17127,508,000020,480