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 25, 2026 00:00Andrew EpsteinAndrew EpsteinScore: 152,367Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 00:01152,328756,910,795745,301,0001,108,0002,117,632stderr
2Sep 25, 2026 00:01152,344757,620,450745,372,0001,116,0002,117,632stderr
3Sep 25, 2026 00:01152,364757,111,718745,466,0001,120,0002,117,632stderr
4Sep 25, 2026 00:01152,365757,151,612745,486,0001,104,0002,117,632stderr
5Sep 25, 2026 00:01152,367757,785,361745,469,0001,130,0002,117,632stderr
6Sep 25, 2026 00:01152,374758,177,238745,518,0001,116,0002,117,632stderr
7Sep 25, 2026 00:01152,405757,980,731745,687,0001,100,0002,117,632stderr
8Sep 25, 2026 00:01152,439758,242,830745,829,0001,125,0002,117,632stderr
9Sep 25, 2026 00:01152,972760,085,144748,449,0001,116,0002,117,632stderr