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 21:27anboto1anboto1Score: 57,764Success
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 21:2857,690291,865,891281,533,0001,152,0002,113,536
2Aug 3, 2026 21:2857,709291,809,242281,683,0001,095,0002,113,536
3Aug 3, 2026 21:2857,714291,904,591281,583,0001,216,0002,113,536
4Aug 3, 2026 21:2857,747292,068,453281,849,0001,114,0002,113,536
5Aug 3, 2026 21:2857,764291,503,020281,952,0001,094,0002,113,536
6Aug 3, 2026 21:2857,784292,201,556282,031,0001,111,0002,113,536
7Aug 3, 2026 21:2857,787291,605,112282,053,0001,104,0002,113,536
8Aug 3, 2026 21:2857,862292,624,923282,426,0001,098,0002,113,536
9Aug 3, 2026 21:2857,869292,204,580282,547,0001,012,0002,113,536