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 1, 2026 17:25Karthik ReddyKarthik ReddyScore: 3,406Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 17:253,36536,898,85926,910,0001,021,00020,480
2Oct 1, 2026 17:253,37338,290,52727,999,000020,480
3Oct 1, 2026 17:253,38237,002,96328,074,000020,480
4Oct 1, 2026 17:253,40337,227,44428,253,000020,480
5Oct 1, 2026 17:253,40637,356,23828,275,000020,480
6Oct 1, 2026 17:253,41137,261,94528,316,000020,480
7Oct 1, 2026 17:253,41637,366,19327,304,0001,055,00020,480
8Oct 1, 2026 17:253,42837,622,43728,453,000020,480
9Oct 1, 2026 17:253,43437,480,50528,510,000020,480