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 16:11wnwnScore: 174,071Success
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 16:12173,809859,951,312849,626,0002,040,0002,113,536
2May 11, 2026 16:12173,809859,885,740849,574,0002,091,0002,113,536
3May 11, 2026 16:12173,842859,650,846849,700,0002,128,0002,113,536
4May 11, 2026 16:12174,060862,209,390850,885,0002,013,0002,113,536
5May 11, 2026 16:12174,071860,418,923850,910,0002,040,0002,113,536
6May 11, 2026 16:12174,075860,327,528850,925,0002,045,0002,113,536
7May 11, 2026 16:12174,078860,757,261850,953,0002,032,0002,113,536
8May 11, 2026 16:12174,083862,639,707850,971,0002,038,0002,113,536
9May 11, 2026 16:12174,087860,430,486850,949,0002,080,0002,113,536