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 23, 2026 13:10Kevin HeaveyKevin HeaveyScore: 41,527Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 13:1140,650209,536,396198,072,0001,117,00020,480
2Sep 23, 2026 13:1140,666209,588,742198,156,0001,112,00020,480
3Sep 23, 2026 13:1140,765210,903,644198,629,0001,124,00020,480
4Sep 23, 2026 13:1141,027211,471,607199,913,0001,123,00020,480
5Sep 23, 2026 13:1141,527213,949,772202,362,0001,125,00020,480
6Sep 23, 2026 13:1141,542213,890,745202,452,0001,108,00020,480
7Sep 23, 2026 13:1141,970216,107,815204,455,0001,199,00020,480
8Sep 23, 2026 13:1142,078216,815,110205,048,0001,136,00020,480
9Sep 23, 2026 13:1142,117216,892,190205,259,0001,118,00020,480