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 15:49timothygktimothygkScore: 21,553Success
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 15:4921,078185,819,452122,457,00052,498,0002,117,632stderr
2Oct 22, 2026 15:4921,201186,987,934122,558,00053,411,0002,117,632stderr
3Oct 22, 2026 15:4921,211187,084,070123,367,00052,685,0002,121,728stderr
4Oct 22, 2026 15:4921,293188,218,390123,554,00053,185,0002,117,632stderr
5Oct 22, 2026 15:4921,553189,867,483123,585,00055,310,0002,117,632stderr
6Oct 22, 2026 15:4921,560190,402,213122,957,00055,997,0002,117,632stderr
7Oct 22, 2026 15:4921,572190,606,720123,840,00055,212,0002,121,728stderr
8Oct 22, 2026 15:4921,601190,313,627124,141,00055,155,0002,117,632stderr
9Oct 22, 2026 15:4921,652191,233,562124,416,00055,300,0002,117,632stderr