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 listMay 12, 2026 14:33wnwnError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 14:330499,892,435488,624,0001,021,0002,113,536expected "560377163019 ", got "10621349131 "
2May 12, 2026 14:330498,648,639488,487,0001,038,0002,113,536expected "560383542317 ", got "10627728429 "
3May 12, 2026 14:330500,185,560488,457,0001,154,0002,113,536expected "560377781517 ", got "10621967629 "