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:10A_ShamanA_ShamanScore: 207,229Success
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:11207,1351,024,304,8091,012,957,0002,009,0002,113,536
2Jun 21, 2026 17:11207,1361,024,165,4831,012,964,0002,007,0002,113,536
3Jun 21, 2026 17:11207,1911,024,357,5881,013,230,0002,006,0002,113,536
4Jun 21, 2026 17:11207,1951,024,415,4921,013,249,0002,007,0002,113,536
5Jun 21, 2026 17:11207,2291,025,882,8731,013,420,0002,004,0002,113,536
6Jun 21, 2026 17:11207,2391,024,650,7751,013,471,0002,004,0002,113,536
7Jun 21, 2026 17:11207,3881,025,393,5391,014,200,0002,006,0002,113,536
8Jun 21, 2026 17:11207,4711,025,796,4841,014,601,0002,007,0002,113,536
9Jun 21, 2026 17:11207,4821,025,792,4621,014,494,0002,169,0002,113,536