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 listAug 2, 2026 17:01anboto1anboto1Score: 76,684Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 17:0276,569385,322,957374,042,0001,148,0002,113,536
2Aug 2, 2026 17:0276,592386,453,525374,157,0001,145,0002,113,536
3Aug 2, 2026 17:0276,648385,690,588374,446,0001,133,0002,113,536
4Aug 2, 2026 17:0276,656385,687,703374,479,0001,136,0002,113,536
5Aug 2, 2026 17:0276,684385,866,339374,622,0001,131,0002,113,536
6Aug 2, 2026 17:0276,704385,849,620374,724,0001,130,0002,113,536
7Aug 2, 2026 17:0276,711386,009,767374,744,0001,144,0002,113,536
8Aug 2, 2026 17:0276,723386,081,555374,815,0001,128,0002,113,536
9Aug 2, 2026 17:0279,863401,452,862390,192,0001,140,0002,113,536