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 17, 2026 01:38M-RochatM-RochatScore: 121,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 01:38118,565589,816,789579,878,0001,091,0002,113,536
2May 17, 2026 01:38119,333593,570,468583,637,0001,099,0002,113,536
3May 17, 2026 01:38120,734600,457,126590,467,0001,130,0002,113,536
4May 17, 2026 01:38120,960601,663,895591,557,0001,150,0002,113,536
5May 17, 2026 01:38121,116602,222,772592,469,0001,004,0002,113,536
6May 17, 2026 01:38121,684605,077,286595,065,0001,187,0002,113,536
7May 17, 2026 01:38122,894611,123,621601,064,0001,121,0002,113,536
8May 17, 2026 01:38122,933611,278,008601,201,0001,173,0002,113,536
9May 17, 2026 01:38122,997612,529,884601,507,0001,179,0002,113,536