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:57wnwnScore: 122,405Success
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:58122,331612,778,311597,184,0002,241,0002,113,536
2May 11, 2026 10:58122,340609,980,806597,321,0002,149,0002,113,536
3May 11, 2026 10:58122,356611,298,744597,523,0002,023,0002,113,536
4May 11, 2026 10:58122,393608,506,926597,591,0002,136,0002,113,536
5May 11, 2026 10:58122,405609,342,913597,762,0002,024,0002,113,536
6May 11, 2026 10:58122,420609,362,225597,598,0002,264,0002,113,536
7May 11, 2026 10:58127,498633,623,046622,540,0002,203,0002,113,536
8May 11, 2026 10:58127,500633,629,997622,562,0002,192,0002,113,536
9May 11, 2026 10:58130,528648,822,598637,346,0002,243,0002,113,536