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:48wnwnScore: 98,991Success
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:5198,425491,005,121480,210,0002,073,0002,113,536
2May 11, 2026 10:5198,428492,626,200480,269,0002,029,0002,113,536
3May 11, 2026 10:5198,491492,782,700480,602,0002,007,0002,113,536
4May 11, 2026 10:5198,980494,587,930483,998,0001,005,0002,113,536
5May 11, 2026 10:5198,991493,884,338483,015,0002,043,0002,113,536
6May 11, 2026 10:5198,994495,054,482483,026,0002,048,0002,113,536
7May 11, 2026 10:5199,003494,652,902483,062,0002,057,0002,113,536
8May 11, 2026 10:5199,014494,081,574483,095,0002,078,0002,113,536
9May 11, 2026 10:5199,071495,006,884483,424,0002,027,0002,113,536