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 21, 2026 15:33Andrew EpsteinAndrew EpsteinScore: 2,230,506Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2026 15:352,161,17326,544,482,1056,269,569,0004,320,181,0002,113,536
2Aug 21, 2026 15:352,230,50626,915,792,1586,324,827,0004,604,657,0002,125,824
3Aug 21, 2026 15:352,251,43227,310,755,7866,333,568,0004,698,450,0002,146,304