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 23, 2026 04:18timothygktimothygkScore: 12,401Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 23, 2026 04:1812,313113,119,10480,975,00021,224,0002,117,632stderr
2Oct 23, 2026 04:1812,334113,202,40281,114,00021,266,0002,117,632stderr
3Oct 23, 2026 04:1812,337113,251,17580,937,00021,462,0002,117,632stderr
4Oct 23, 2026 04:1812,390113,886,07480,879,00021,965,0002,117,632stderr
5Oct 23, 2026 04:1812,401113,949,36481,484,00021,449,0002,117,632stderr
6Oct 23, 2026 04:1812,496114,720,40681,567,00022,154,0002,117,632stderr
7Oct 23, 2026 04:1812,823117,283,45185,156,00021,279,0002,117,632stderr
8Oct 23, 2026 04:1812,866117,685,72285,498,00021,293,0002,117,632stderr
9Oct 23, 2026 04:1812,974118,951,57285,916,00021,774,0002,117,632stderr