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:08Josu San MartinJosu San MartinScore: 30,332Success
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:0930,303159,296,046147,356,0001,130,0002,113,536
2Aug 2, 2026 15:0930,307158,588,072147,376,0001,131,0002,113,536
3Aug 2, 2026 15:0930,316159,363,476147,405,0001,145,0002,113,536
4Aug 2, 2026 15:0930,321158,520,571147,453,0001,122,0002,113,536
5Aug 2, 2026 15:0930,332160,682,141147,487,0001,144,0002,113,536
6Aug 2, 2026 15:0930,334158,636,629147,522,0001,118,0002,113,536
7Aug 2, 2026 15:0930,340159,777,992147,529,0001,138,0002,113,536
8Aug 2, 2026 15:0930,372158,854,972147,702,0001,123,0002,113,536
9Aug 2, 2026 15:0930,567159,912,228148,647,0001,135,0002,113,536