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 listNov 12, 2025 11:29izotoffizotoffScore: 241,924Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2025 11:29241,8421,215,433,8781,183,026,0001,998,0002,322,432
2Nov 12, 2025 11:29241,8921,212,070,5761,181,272,0003,997,0002,420,736
3Nov 12, 2025 11:29241,9111,215,469,2561,181,365,0003,997,0002,322,432
4Nov 12, 2025 11:29241,9131,212,567,1101,179,379,0005,996,0002,322,432
5Nov 12, 2025 11:29241,9241,209,695,6051,181,430,0003,998,0002,326,528
6Nov 12, 2025 11:29241,9261,209,707,6851,181,438,0003,998,0002,322,432
7Nov 12, 2025 11:29241,9411,206,607,6021,182,513,0002,998,0002,408,448
8Nov 12, 2025 11:29241,9511,217,022,8051,183,561,0001,999,0002,420,736
9Nov 12, 2025 11:29241,9731,216,811,0631,183,667,0001,999,0002,330,624