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 10:41wnwnScore: 99,227Success
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 10:4398,648493,811,107481,343,0002,033,0002,113,536
2May 11, 2026 10:4398,673494,458,210481,441,0002,060,0002,113,536
3May 11, 2026 10:4398,683493,620,160481,495,0002,054,0002,113,536
4May 11, 2026 10:4399,164495,873,805483,865,0002,041,0002,113,536
5May 11, 2026 10:4399,227495,466,835484,159,0002,057,0002,113,536
6May 11, 2026 10:4399,257507,938,487484,323,0002,039,0002,113,536
7May 11, 2026 10:4399,286496,461,794484,482,0002,021,0002,113,536
8May 11, 2026 10:4399,495498,534,556485,518,0002,011,0002,113,536
9May 11, 2026 10:4399,637499,968,137486,197,0002,029,0002,113,536