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 24, 2026 17:57Victor MerckléVictor MerckléScore: 29,075Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 17:5828,956152,002,660139,865,0002,024,0002,117,632stderr
2Aug 24, 2026 17:5829,033152,111,883141,256,0001,009,0002,117,632stderr
3Aug 24, 2026 17:5829,042152,897,502140,302,0002,008,0002,117,632stderr
4Aug 24, 2026 17:5829,047152,040,174140,313,0002,018,0002,117,632stderr
5Aug 24, 2026 17:5829,075152,494,125141,461,0001,010,0002,117,632stderr
6Aug 24, 2026 17:5829,106152,782,375140,613,0002,011,0002,117,632stderr
7Aug 24, 2026 17:5829,131153,006,517139,725,0003,020,0002,117,632stderr
8Aug 24, 2026 17:5829,193153,227,488142,038,0001,010,0002,117,632stderr
9Aug 24, 2026 17:5829,395154,279,052143,026,0001,010,0002,117,632stderr