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 4, 2026 17:32Josu San MartinJosu San MartinScore: 25,796Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 17:3225,757134,671,392124,940,0001,271,0002,113,536
2Aug 4, 2026 17:3225,758134,752,388124,954,0001,264,0002,113,536
3Aug 4, 2026 17:3225,759135,243,598124,943,0001,279,0002,113,536
4Aug 4, 2026 17:3225,794135,480,149125,137,0001,258,0002,113,536
5Aug 4, 2026 17:3225,796134,807,684125,146,0001,255,0002,113,536
6Aug 4, 2026 17:3225,801134,832,884125,160,0001,268,0002,113,536
7Aug 4, 2026 17:3225,920135,376,630125,758,0001,251,0002,113,536
8Aug 4, 2026 17:3225,945136,243,830125,870,0001,261,0002,113,536
9Aug 4, 2026 17:3226,004137,725,440126,303,0001,117,0002,113,536