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 24, 2026 16:30Andrew EpsteinAndrew EpsteinScore: 40,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 16:3140,128216,578,145195,389,0001,240,0002,113,536
2Sep 24, 2026 16:3140,203212,844,327195,766,0001,231,0002,113,536
3Sep 24, 2026 16:3140,248212,361,101196,030,0001,188,0002,117,632
4Sep 24, 2026 16:3140,258217,144,172196,008,0001,258,0002,113,536
5Sep 24, 2026 16:3140,283210,395,691196,213,0001,178,0002,113,536
6Sep 24, 2026 16:3140,335208,089,152196,538,0001,106,0002,113,536
7Sep 24, 2026 16:3140,367212,055,362196,625,0001,178,0002,113,536
8Sep 24, 2026 16:3141,839215,618,979200,852,0004,161,0002,113,536
9Sep 24, 2026 16:3142,638223,045,596202,497,0006,431,0002,113,536