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 11, 2026 14:53wnwnScore: 98,591Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 14:5598,510491,898,122481,699,0001,004,0002,113,536
2May 11, 2026 14:5598,552491,683,196480,899,0002,008,0002,113,536
3May 11, 2026 14:5598,577490,372,858482,025,0001,005,0002,113,536
4May 11, 2026 14:5598,589492,631,922480,981,0002,106,0002,113,536
5May 11, 2026 14:5598,591490,506,759481,056,0002,044,0002,113,536
6May 11, 2026 14:5598,619492,593,986482,232,0001,005,0002,113,536
7May 11, 2026 14:5598,713491,112,620481,694,0002,004,0002,113,536
8May 11, 2026 14:55100,331500,685,223490,617,0001,005,0002,113,536
9May 11, 2026 14:55100,566500,441,386491,770,0001,005,0002,113,536