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 28, 2026 00:55A_ShamanA_ShamanScore: 157,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 00:55157,323781,240,076766,874,0004,011,0002,146,304
2Jun 28, 2026 00:55157,326780,970,791765,883,0005,015,0002,146,304
3Jun 28, 2026 00:55157,336781,530,426766,942,0004,008,0002,146,304
4Jun 28, 2026 00:55157,362781,650,695767,063,0004,011,0002,146,304
5Jun 28, 2026 00:55157,378781,135,644767,141,0004,014,0002,146,304
6Jun 28, 2026 00:55157,393785,569,293767,222,0004,008,0002,146,304
7Jun 28, 2026 00:55157,414781,736,453767,318,0004,012,0002,146,304
8Jun 28, 2026 00:55157,478782,084,813767,632,0004,014,0002,146,304
9Jun 28, 2026 00:55157,482782,053,406767,653,0004,013,0002,146,304