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:47wnwnScore: 103,311Success
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:48103,104516,090,254503,137,0002,074,0002,113,536
2May 11, 2026 09:48103,132516,041,497503,345,0002,006,0002,113,536
3May 11, 2026 09:48103,136514,757,712503,323,0002,045,0002,113,536
4May 11, 2026 09:48103,196516,376,974503,628,0002,036,0002,113,536
5May 11, 2026 09:48103,311517,736,170504,180,0002,045,0002,113,536
6May 11, 2026 09:48103,549516,216,495505,312,0002,081,0002,113,536
7May 11, 2026 09:48103,568516,203,551505,426,0002,061,0002,113,536
8May 11, 2026 09:48103,594516,328,799506,608,0001,003,0002,113,536
9May 11, 2026 09:48103,597516,418,763505,605,0002,024,0002,113,536