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 22, 2026 16:27timothygktimothygkScore: 16,356Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 22, 2026 16:2816,218146,805,309105,675,00028,936,0002,117,632stderr
2Oct 22, 2026 16:2816,220145,659,694105,460,00029,173,0002,117,632stderr
3Oct 22, 2026 16:2816,231145,597,531105,311,00029,408,0002,117,632stderr
4Oct 22, 2026 16:2816,292146,174,885105,637,00029,588,0002,117,632stderr
5Oct 22, 2026 16:2816,356146,671,128105,896,00029,861,0002,117,632stderr
6Oct 22, 2026 16:2816,356147,163,594105,806,00029,957,0002,117,632stderr
7Oct 22, 2026 16:2816,376147,325,093106,361,00029,562,0002,117,632stderr
8Oct 22, 2026 16:2816,409147,587,732105,975,00030,222,0002,117,632stderr
9Oct 22, 2026 16:2816,507148,582,273106,295,00030,714,0002,117,632stderr