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 23, 2026 15:56Andrew EpsteinAndrew EpsteinScore: 85,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 15:5784,310423,060,134411,893,0001,227,0002,113,536
2Aug 23, 2026 15:5785,049426,694,578415,511,0001,232,0002,113,536
3Aug 23, 2026 15:5785,057426,613,261415,777,0001,004,0002,113,536
4Aug 23, 2026 15:5785,083426,840,645415,648,0001,260,0002,113,536
5Aug 23, 2026 15:5785,086426,754,822415,922,0001,002,0002,113,536
6Aug 23, 2026 15:5785,092426,838,400415,717,0001,234,0002,113,536
7Aug 23, 2026 15:5785,106426,863,513416,019,0001,001,0002,113,536
8Aug 23, 2026 15:5785,115426,949,461416,066,0001,001,0002,113,536
9Aug 23, 2026 15:5785,161427,201,127416,160,0001,132,0002,113,536