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:25wnwnScore: 98,828Success
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:2698,665495,169,228481,398,0002,064,0002,113,536
2May 11, 2026 10:2698,674495,481,781481,446,0002,057,0002,113,536
3May 11, 2026 10:2698,678494,467,503481,506,0002,017,0002,113,536
4May 11, 2026 10:2698,722493,408,361481,722,0002,016,0002,113,536
5May 11, 2026 10:2698,828505,694,755483,255,0001,005,0002,113,536
6May 11, 2026 10:2699,215496,074,890484,124,0002,034,0002,113,536
7May 11, 2026 10:2699,236495,763,435485,257,0001,004,0002,113,536
8May 11, 2026 10:2699,270495,181,160484,387,0002,037,0002,113,536
9May 11, 2026 10:2699,310496,249,346484,609,0002,011,0002,113,536