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 11:41Karthik ReddyKarthik ReddyScore: 3,271Success
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 11:413,26336,171,09425,996,0001,089,00020,480
2Oct 2, 2026 11:413,26836,143,89126,032,0001,100,00020,480
3Oct 2, 2026 11:413,26936,107,96926,021,0001,114,00020,480
4Oct 2, 2026 11:413,27036,180,94326,058,0001,087,00020,480
5Oct 2, 2026 11:413,27136,169,64226,046,0001,106,00020,480
6Oct 2, 2026 11:413,27236,189,80226,051,0001,108,00020,480
7Oct 2, 2026 11:413,27236,191,18526,077,0001,086,00020,480
8Oct 2, 2026 11:413,27336,170,16026,080,0001,091,00020,480
9Oct 2, 2026 11:413,29036,799,30426,136,0001,172,00020,480