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 listJul 11, 2026 04:25RayRayScore: 2,139,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 11, 2026 04:272,068,64326,532,675,6315,904,546,0004,231,807,0002,113,536
2Jul 11, 2026 04:272,139,97025,979,535,5525,970,272,0004,515,584,0002,117,632
3Jul 11, 2026 04:272,178,73933,079,669,9135,981,907,0004,693,917,0002,166,784