Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listSep 23, 2026 22:48Kevin HeaveyKevin HeaveyScore: 24,352Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 22:4924,332127,987,205118,180,0001,049,00020,480
2Sep 23, 2026 22:4924,341127,919,952118,172,0001,100,00020,480
3Sep 23, 2026 22:4924,347128,206,554118,248,0001,053,00020,480
4Sep 23, 2026 22:4924,347128,016,178118,242,0001,062,00020,480
5Sep 23, 2026 22:4924,352128,151,234118,270,0001,059,00020,480
6Sep 23, 2026 22:4924,360128,147,398118,316,0001,048,00020,480
7Sep 23, 2026 22:4924,395128,285,887118,489,0001,049,00020,480
8Sep 23, 2026 22:4924,397128,156,375118,496,0001,054,00020,480
9Sep 23, 2026 22:4924,407128,489,896118,534,0001,062,00020,480