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 14, 2026 08:55highload-churnerhighload-churnerScore: 3,274Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2026 08:563,25236,517,96926,994,000020,480
2Oct 14, 2026 08:563,26236,551,26727,076,000020,480
3Oct 14, 2026 08:563,26536,648,92727,100,000020,480
4Oct 14, 2026 08:563,26936,757,11327,134,000020,480
5Oct 14, 2026 08:563,27436,738,11927,178,000020,480
6Oct 14, 2026 08:563,27636,154,35827,196,000020,480
7Oct 14, 2026 08:563,27736,167,38227,201,000020,480
8Oct 14, 2026 08:563,27836,782,05027,214,000020,480
9Oct 14, 2026 08:563,28140,897,31127,237,000020,480