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 listJul 27, 2026 14:50Kevin HeaveyKevin HeaveyScore: 64,636Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 15:2864,058323,997,910305,313,0008,573,00020,480
2Jul 27, 2026 15:2864,267325,360,452305,733,0009,178,00020,480
3Jul 27, 2026 15:2864,380326,296,369306,872,0008,590,00020,480
4Jul 27, 2026 15:2864,391326,305,138305,049,00010,467,00020,480
5Jul 27, 2026 15:2864,636326,778,632306,621,00010,097,00020,480
6Jul 27, 2026 15:2864,642326,842,356306,782,0009,964,00020,480
7Jul 27, 2026 15:2864,721327,233,503306,037,00011,098,00020,480
8Jul 27, 2026 15:2864,805327,646,947306,915,00010,634,00020,480
9Jul 27, 2026 15:2865,115329,789,175306,412,00012,656,00020,480