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 9, 2026 21:11Karthik ReddyKarthik ReddyScore: 3,315Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 21:123,2673,036,267,89726,108,0001,016,00020,480
2Oct 9, 2026 21:123,2723,036,230,67827,160,000020,480
3Oct 9, 2026 21:123,3053,036,440,99726,437,0001,002,00020,480
4Oct 9, 2026 21:123,3063,036,463,95327,445,000020,480
5Oct 9, 2026 21:123,3153,036,610,38127,517,000020,480
6Oct 9, 2026 21:123,3233,036,685,87627,582,000020,480
7Oct 9, 2026 21:123,3273,038,243,64926,606,0001,015,00020,480
8Oct 9, 2026 21:123,3533,039,299,17726,827,0001,003,00020,480
9Oct 9, 2026 21:123,3573,037,182,74327,866,000020,480