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:29wnwnScore: 99,170Success
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:3098,633494,830,879481,260,0002,042,0002,113,536
2May 11, 2026 10:3098,651493,631,194481,362,0002,028,0002,113,536
3May 11, 2026 10:3098,681495,730,290481,528,0002,013,0002,113,536
4May 11, 2026 10:3098,693493,767,656481,523,0002,075,0002,113,536
5May 11, 2026 10:3099,170494,770,040483,909,0002,025,0002,113,536
6May 11, 2026 10:3099,280495,341,825484,410,0002,064,0002,113,536
7May 11, 2026 10:3099,334497,349,346485,734,0001,003,0002,113,536
8May 11, 2026 10:3099,358495,735,271484,692,0002,164,0002,113,536
9May 11, 2026 10:3099,403496,599,145485,052,0002,023,0002,113,536