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 08:11wnwnScore: 105,852Success
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 08:12105,670528,023,046515,742,0002,043,0002,113,536
2May 11, 2026 08:12105,737529,310,866516,062,0002,050,0002,113,536
3May 11, 2026 08:12105,805529,925,679516,420,0002,029,0002,113,536
4May 11, 2026 08:12105,824527,775,371516,460,0002,082,0002,113,536
5May 11, 2026 08:12105,852527,995,904516,598,0002,079,0002,113,536
6May 11, 2026 08:12105,853528,804,315516,657,0002,026,0002,113,536
7May 11, 2026 08:12105,907529,775,754516,894,0002,052,0002,113,536
8May 11, 2026 08:12112,721566,115,961550,274,0002,062,0002,113,536
9May 11, 2026 08:12112,763561,322,393550,450,0002,090,0002,113,536