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 15:58Karthik ReddyKarthik ReddyScore: 3,324Success
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 16:003,30036,391,90927,397,000020,480
2Oct 1, 2026 16:003,30636,468,45527,448,000020,480
3Oct 1, 2026 16:003,30636,666,72827,448,000020,480
4Oct 1, 2026 16:003,31338,099,87726,499,0001,003,00020,480
5Oct 1, 2026 16:003,32436,640,15326,579,0001,014,00020,480
6Oct 1, 2026 16:003,39737,265,51428,197,000020,480
7Oct 1, 2026 16:003,39937,227,76928,213,000020,480
8Oct 1, 2026 16:003,42137,346,77628,397,000020,480
9Oct 1, 2026 16:003,45437,670,92428,670,000020,480