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 29, 2026 03:28Josu San MartinJosu San MartinScore: 24,314Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 03:2924,203127,635,516117,346,0001,252,0002,113,536
2Aug 29, 2026 03:2924,206127,078,745117,341,0001,270,0002,113,536
3Aug 29, 2026 03:2924,208127,598,484117,382,0001,242,0002,113,536
4Aug 29, 2026 03:2924,211127,038,789117,375,0001,260,0002,113,536
5Aug 29, 2026 03:2924,314127,389,004117,872,0001,268,0002,113,536
6Aug 29, 2026 03:2924,571129,144,544119,140,0001,260,0002,113,536
7Aug 29, 2026 03:2924,776130,506,174120,159,0001,244,0002,113,536
8Aug 29, 2026 03:2925,456133,795,440123,470,0001,267,0002,113,536
9Aug 29, 2026 03:2930,037156,206,236145,935,0001,249,0002,113,536