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:49Kevin HeaveyKevin HeaveyScore: 24,133Success
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:5024,120126,975,571117,135,0001,053,00020,480
2Sep 23, 2026 23:5024,124127,010,192117,148,0001,064,00020,480
3Sep 23, 2026 23:5024,131126,998,680117,188,0001,058,00020,480
4Sep 23, 2026 23:5024,131126,911,228117,176,0001,070,00020,480
5Sep 23, 2026 23:5024,133127,018,935117,206,0001,046,00020,480
6Sep 23, 2026 23:5024,134126,785,043117,183,0001,077,00020,480
7Sep 23, 2026 23:5024,147127,067,384117,209,0001,112,00020,480
8Sep 23, 2026 23:5024,206127,314,950117,609,0001,002,00020,480
9Sep 23, 2026 23:5024,288127,830,284117,962,0001,052,00020,480