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 06:34Karthik ReddyKarthik ReddyScore: 3,323Success
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 06:373,3083,036,514,01527,458,000020,480
2Oct 2, 2026 06:373,3173,036,563,42027,534,000020,480
3Oct 2, 2026 06:373,3213,036,697,28327,566,000020,480
4Oct 2, 2026 06:373,3223,036,672,92727,578,000020,480
5Oct 2, 2026 06:373,3233,036,709,83127,584,000020,480
6Oct 2, 2026 06:373,3263,036,632,70727,614,000020,480
7Oct 2, 2026 06:373,3283,036,723,98726,599,0001,026,00020,480
8Oct 2, 2026 06:373,3333,037,643,57227,670,000020,480
9Oct 2, 2026 06:373,3433,036,834,64326,737,0001,010,00020,480