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 14:39Josu San MartinJosu San MartinScore: 25,238Success
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 14:3925,186131,790,676122,169,0001,245,0002,113,536
2Aug 4, 2026 14:3925,188132,084,266122,171,0001,254,0002,113,536
3Aug 4, 2026 14:3925,189131,928,303122,170,0001,258,0002,113,536
4Aug 4, 2026 14:3925,190131,863,992122,169,0001,264,0002,113,536
5Aug 4, 2026 14:3925,238132,099,509122,480,0001,188,0002,113,536
6Aug 4, 2026 14:3925,256132,182,601122,502,0001,253,0002,113,536
7Aug 4, 2026 14:3925,256132,208,738122,483,0001,274,0002,113,536
8Aug 4, 2026 14:3925,295132,416,563122,683,0001,267,0002,113,536
9Aug 4, 2026 14:3925,694134,344,628124,638,0001,266,0002,113,536