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:19wnwnScore: 98,993Success
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:2198,898495,634,402482,428,0002,176,0002,113,536
2May 11, 2026 10:2198,938493,420,852482,666,0002,132,0002,113,536
3May 11, 2026 10:2198,944493,612,021482,678,0002,150,0002,113,536
4May 11, 2026 10:2198,948496,570,298482,757,0002,091,0002,113,536
5May 11, 2026 10:2198,993495,812,654483,014,0002,054,0002,113,536
6May 11, 2026 10:2199,086495,747,513483,440,0002,083,0002,113,536
7May 11, 2026 10:2199,415496,061,796485,003,0002,135,0002,113,536
8May 11, 2026 10:2199,468498,327,082485,120,0002,274,0002,113,536
9May 11, 2026 10:21130,077646,224,499635,219,0002,162,0002,113,536