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 20:32anboto1anboto1Score: 57,921Success
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 20:3457,764292,671,809281,820,0001,226,0002,113,536
2Aug 3, 2026 20:3457,797292,135,480282,089,0001,119,0002,113,536
3Aug 3, 2026 20:3457,806294,258,096282,103,0001,147,0002,113,536
4Aug 3, 2026 20:3457,916294,523,753282,658,0001,131,0002,113,536
5Aug 3, 2026 20:3457,921292,940,512282,559,0001,256,0002,113,536
6Aug 3, 2026 20:3457,924292,326,033282,694,0001,136,0002,113,536
7Aug 3, 2026 20:3458,018292,777,669283,083,0001,207,0002,113,536
8Aug 3, 2026 20:3458,050292,910,915283,195,0001,254,0002,113,536
9Aug 3, 2026 20:3458,498295,778,151285,511,0001,134,0002,113,536