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 3, 2026 20:23anboto1anboto1Score: 63,082Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 20:2462,196312,996,150303,593,0001,171,0002,113,536
2Aug 3, 2026 20:2462,243314,261,560303,983,0001,012,0002,113,536
3Aug 3, 2026 20:2462,385314,787,143304,590,0001,101,0002,113,536
4Aug 3, 2026 20:2462,404313,938,792304,666,0001,115,0002,113,536
5Aug 3, 2026 20:2463,082318,095,800307,999,0001,104,0002,113,536
6Aug 3, 2026 20:2465,498330,074,449319,856,0001,088,0002,113,536
7Aug 3, 2026 20:2465,602330,532,282320,359,0001,093,0002,113,536
8Aug 3, 2026 20:2465,702331,688,678320,842,0001,101,0002,113,536
9Aug 3, 2026 20:2466,189333,512,202323,119,0001,210,0002,113,536