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:16Karthik ReddyKarthik ReddyScore: 3,250Success
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:193,2323,035,807,09426,826,000020,480
2Oct 9, 2026 21:193,2363,035,912,52626,860,000020,480
3Oct 9, 2026 21:193,2423,035,903,14926,913,000020,480
4Oct 9, 2026 21:193,2473,035,909,47625,939,0001,013,00020,480
5Oct 9, 2026 21:193,2503,036,091,22125,975,0001,003,00020,480
6Oct 9, 2026 21:193,2563,036,075,64425,979,0001,047,00020,480
7Oct 9, 2026 21:193,2583,036,149,05927,047,000020,480
8Oct 9, 2026 21:193,2943,036,250,47127,342,000020,480
9Oct 9, 2026 21:193,3303,037,613,17427,641,000020,480