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 10:11Josu San MartinJosu San MartinScore: 29,529Success
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 10:1229,514153,158,517143,617,0001,006,0002,113,536
2Aug 3, 2026 10:1229,515153,824,060143,355,0001,272,0002,113,536
3Aug 3, 2026 10:1229,515153,132,430143,361,0001,264,0002,113,536
4Aug 3, 2026 10:1229,521153,100,894143,607,0001,049,0002,113,536
5Aug 3, 2026 10:1229,529152,924,890143,681,0001,012,0002,113,536
6Aug 3, 2026 10:1229,540153,162,023143,489,0001,261,0002,113,536
7Aug 3, 2026 10:1229,568153,967,947143,762,0001,126,0002,113,536
8Aug 3, 2026 10:1229,638154,319,609143,963,0001,266,0002,113,536
9Aug 3, 2026 10:1229,726156,370,425144,393,0001,267,0002,113,536