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 09:57wnwnScore: 98,812Success
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 09:5898,748494,478,920481,845,0002,024,0002,113,536
2May 11, 2026 09:5898,762492,699,937481,901,0002,035,0002,113,536
3May 11, 2026 09:5898,776493,805,992481,927,0002,076,0002,113,536
4May 11, 2026 09:5898,789493,013,666482,029,0002,040,0002,113,536
5May 11, 2026 09:5898,812492,900,048482,150,0002,032,0002,113,536
6May 11, 2026 09:5899,310495,475,691484,583,0002,036,0002,113,536
7May 11, 2026 09:5899,312495,309,025484,575,0002,056,0002,113,536
8May 11, 2026 09:5899,313497,069,381484,581,0002,053,0002,113,536
9May 11, 2026 09:5899,344495,526,519484,734,0002,053,0002,113,536