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 15:48wnwnScore: 99,781Success
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 15:4899,748498,283,588487,719,0001,050,0002,113,536
2May 12, 2026 15:4899,764496,315,649487,825,0001,022,0002,113,536
3May 12, 2026 15:4899,778497,796,705487,875,0001,041,0002,113,536
4May 12, 2026 15:4899,779498,528,887487,783,0001,138,0002,113,536
5May 12, 2026 15:4899,781496,403,310487,809,0001,122,0002,113,536
6May 12, 2026 15:4899,828497,896,883488,149,0001,010,0002,113,536
7May 12, 2026 15:4899,832496,996,653488,097,0001,081,0002,113,536
8May 12, 2026 15:4899,851496,731,869488,218,0001,054,0002,113,536
9May 12, 2026 15:48100,100500,977,071489,284,0001,210,0002,113,536