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 2, 2026 07:39A_ShamanA_ShamanScore: 145,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 07:39145,491722,988,379710,643,0002,265,0002,113,536
2Jul 2, 2026 07:39145,498723,990,333710,692,0002,249,0002,113,536
3Jul 2, 2026 07:39145,547723,346,884710,948,0002,234,0002,113,536
4Jul 2, 2026 07:39145,578723,346,103711,075,0002,259,0002,113,536
5Jul 2, 2026 07:39145,659723,732,705711,714,0002,017,0002,113,536
6Jul 2, 2026 07:39145,691723,525,815711,651,0002,237,0002,113,536
7Jul 2, 2026 07:39145,713724,160,590710,939,0003,057,0002,113,536
8Jul 2, 2026 07:39145,783724,503,947712,298,0002,040,0002,113,536
9Jul 2, 2026 07:39146,726729,087,201716,714,0002,244,0002,113,536