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 listAug 15, 2026 14:26Tomislav TunkovicTomislav TunkovicScore: 32,184Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 14:2731,882164,792,719154,192,0002,032,00020,480
2Aug 15, 2026 14:2732,065167,546,691156,113,0001,010,00020,480
3Aug 15, 2026 14:2732,124166,521,677156,400,0001,012,00020,480
4Aug 15, 2026 14:2732,173166,137,144156,639,0001,009,00020,480
5Aug 15, 2026 14:2732,184166,227,080155,685,0002,018,00020,480
6Aug 15, 2026 14:2732,475168,231,189158,118,0001,010,00020,480
7Aug 15, 2026 14:2733,586173,787,505163,565,0001,011,00020,480
8Aug 15, 2026 14:2733,794174,698,286164,582,0001,013,00020,480
9Aug 15, 2026 14:2733,799174,203,134164,606,0001,013,00020,480