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 2, 2026 11:25anboto1anboto1Score: 182,394Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 11:26181,777900,905,779889,481,0001,229,0002,113,536
2Aug 2, 2026 11:26181,897901,392,317890,075,0001,223,0002,113,536
3Aug 2, 2026 11:26182,174902,722,918891,410,0001,245,0002,113,536
4Aug 2, 2026 11:26182,228903,685,006891,689,0001,231,0002,113,536
5Aug 2, 2026 11:26182,394916,641,286892,413,0001,321,0002,113,536
6Aug 2, 2026 11:26182,415916,095,190892,514,0001,323,0002,113,536
7Aug 2, 2026 11:26185,217917,747,861906,338,0001,227,0002,113,536
8Aug 2, 2026 11:26185,553919,393,692907,972,0001,242,0002,113,536
9Aug 2, 2026 11:26186,023931,986,796910,212,0001,301,0002,113,536