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 15:34Josu San MartinJosu San MartinScore: 31,433Success
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 15:3531,421163,984,584152,862,0001,102,0002,113,536
2Aug 2, 2026 15:3531,429164,363,486152,861,0001,143,0002,113,536
3Aug 2, 2026 15:3531,430165,274,937152,890,0001,121,0002,113,536
4Aug 2, 2026 15:3531,431164,158,236152,891,0001,124,0002,113,536
5Aug 2, 2026 15:3531,433164,827,838152,901,0001,122,0002,113,536
6Aug 2, 2026 15:3531,442164,974,299152,948,0001,119,0002,113,536
7Aug 2, 2026 15:3531,450164,111,093152,987,0001,122,0002,113,536
8Aug 2, 2026 15:3531,451164,122,823152,982,0001,130,0002,113,536
9Aug 2, 2026 15:3531,462164,980,772153,038,0001,128,0002,113,536