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 listJun 21, 2026 17:05A_ShamanA_ShamanScore: 323,592Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 17:06323,4961,594,505,1721,583,127,0002,006,0002,113,536
2Jun 21, 2026 17:06323,5131,594,420,4961,583,213,0002,005,0002,113,536
3Jun 21, 2026 17:06323,5191,594,369,6541,583,242,0002,003,0002,113,536
4Jun 21, 2026 17:06323,5341,594,542,3611,583,313,0002,007,0002,113,536
5Jun 21, 2026 17:06323,5921,595,127,0421,582,569,0003,032,0002,113,536
6Jun 21, 2026 17:06323,6551,594,986,1591,582,843,0003,067,0002,113,536
7Jun 21, 2026 17:06323,7051,595,351,3181,582,954,0003,204,0002,113,536
8Jun 21, 2026 17:06323,7081,595,300,5961,583,075,0003,099,0002,113,536
9Jun 21, 2026 17:06323,7731,595,706,5851,583,482,0003,006,0002,113,536