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 07:11Karthik ReddyKarthik ReddyScore: 3,414Success
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 07:113,40537,337,26027,243,0001,022,00020,480
2Oct 2, 2026 07:113,40737,463,28327,258,0001,022,00020,480
3Oct 2, 2026 07:113,41137,343,70627,294,0001,022,00020,480
4Oct 2, 2026 07:113,41337,214,86727,312,0001,024,00020,480
5Oct 2, 2026 07:113,41437,384,77127,316,0001,022,00020,480
6Oct 2, 2026 07:113,41637,353,52927,330,0001,023,00020,480
7Oct 2, 2026 07:113,41737,415,51527,347,0001,022,00020,480
8Oct 2, 2026 07:113,41837,429,50227,353,0001,022,00020,480
9Oct 2, 2026 07:113,49438,024,41727,987,0001,014,00020,480