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 19, 2026 13:23Andrew EpsteinAndrew EpsteinScore: 768,547Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 13:24768,3333,775,656,7013,691,688,00073,145,00028,672stderr
2Sep 19, 2026 13:24768,3603,775,458,5213,691,251,00073,717,00032,768stderr
3Sep 19, 2026 13:24768,5203,776,179,7803,692,865,00072,883,00032,768stderr
4Sep 19, 2026 13:24768,5383,776,372,9203,692,181,00073,657,00032,768stderr
5Sep 19, 2026 13:24768,5473,776,346,8403,693,294,00072,588,00028,672stderr
6Sep 19, 2026 13:24768,6613,777,052,3993,692,151,00074,288,00028,672stderr
7Sep 19, 2026 13:24768,7013,788,340,4293,692,492,00074,145,00028,672stderr
8Sep 19, 2026 13:24769,0603,778,933,5793,694,097,00074,301,0002,125,824stderr
9Sep 19, 2026 13:24770,4553,785,908,9513,696,506,00078,727,00032,768stderr