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:16Josu San MartinJosu San MartinScore: 24,994Success
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:1624,966130,848,488121,066,0001,271,0002,113,536
2Aug 29, 2026 03:1624,975132,096,608121,134,0001,248,0002,113,536
3Aug 29, 2026 03:1624,976130,800,317121,128,0001,256,0002,113,536
4Aug 29, 2026 03:1624,983131,409,953121,148,0001,272,0002,113,536
5Aug 29, 2026 03:1624,994130,898,233121,226,0001,248,0002,113,536
6Aug 29, 2026 03:1624,996131,504,065121,217,0001,267,0002,113,536
7Aug 29, 2026 03:1625,046131,138,922121,537,0001,193,0002,113,536
8Aug 29, 2026 03:1625,048131,132,139121,547,0001,189,0002,113,536
9Aug 29, 2026 03:1625,147131,716,912121,971,0001,254,0002,113,536