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:09wnwnScore: 101,072Success
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:11100,885502,221,285493,333,0001,005,0002,113,536
2May 11, 2026 14:11100,912501,965,901493,467,0001,004,0002,113,536
3May 11, 2026 14:11100,921502,079,641493,513,0001,004,0002,113,536
4May 11, 2026 14:11101,024502,984,228494,017,0001,005,0002,113,536
5May 11, 2026 14:11101,072503,486,931494,253,0001,004,0002,113,536
6May 11, 2026 14:11101,085505,677,935494,314,0001,004,0002,113,536
7May 11, 2026 14:11101,164505,027,921494,705,0001,003,0002,113,536
8May 11, 2026 14:11101,224505,116,807494,997,0001,004,0002,113,536
9May 11, 2026 14:11102,051508,347,783499,050,0001,004,0002,113,536