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 08:56A_ShamanA_ShamanScore: 164,183Success
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 08:57164,130814,772,244803,142,0001,099,0002,150,400
2Jul 2, 2026 08:57164,165814,697,095803,295,0001,116,0002,150,400
3Jul 2, 2026 08:57164,167814,631,788803,290,0001,130,0002,150,400
4Jul 2, 2026 08:57164,173814,702,252803,343,0001,108,0002,150,400
5Jul 2, 2026 08:57164,183815,247,022803,358,0001,139,0002,150,400
6Jul 2, 2026 08:57164,215814,923,977803,549,0001,106,0002,150,400
7Jul 2, 2026 08:57164,249815,052,461803,691,0001,130,0002,150,400
8Jul 2, 2026 08:57164,300815,241,837803,967,0001,103,0002,150,400
9Jul 2, 2026 08:57164,498816,479,631804,929,0001,114,0002,158,592