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 23:15Kevin HeaveyKevin HeaveyScore: 24,192Success
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 23:1624,168127,249,119117,358,0001,067,00020,480
2Sep 23, 2026 23:1624,173127,211,187117,392,0001,060,00020,480
3Sep 23, 2026 23:1624,177127,158,591117,415,0001,055,00020,480
4Sep 23, 2026 23:1624,189127,294,672117,480,0001,048,00020,480
5Sep 23, 2026 23:1624,192127,337,144117,496,0001,047,00020,480
6Sep 23, 2026 23:1624,196127,300,876117,510,0001,054,00020,480
7Sep 23, 2026 23:1624,201127,327,375117,534,0001,054,00020,480
8Sep 23, 2026 23:1624,227127,386,304117,705,0001,011,00020,480
9Sep 23, 2026 23:1624,444128,522,981118,731,0001,048,00020,480