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 18, 2026 01:33M-RochatM-RochatScore: 110,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 01:34110,610553,232,761540,851,0001,142,0002,113,536
2May 18, 2026 01:34110,624554,364,917540,913,0001,147,0002,113,536
3May 18, 2026 01:34110,624554,081,745540,929,0001,132,0002,113,536
4May 18, 2026 01:34110,635551,570,673540,972,0001,141,0002,113,536
5May 18, 2026 01:34110,705551,982,878541,307,0001,152,0002,113,536
6May 18, 2026 01:34110,955552,994,599542,546,0001,135,0002,113,536
7May 18, 2026 01:34110,985554,021,579542,685,0001,142,0002,113,536
8May 18, 2026 01:34111,277554,553,806544,116,0001,145,0002,113,536
9May 18, 2026 01:34114,271593,698,928558,711,0001,219,0002,113,536