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 21:34anboto1anboto1Score: 57,709Success
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 21:3557,575291,174,366281,032,0001,086,0002,113,536
2Aug 3, 2026 21:3557,607290,796,452281,187,0001,089,0002,113,536
3Aug 3, 2026 21:3557,625291,335,233281,268,0001,095,0002,113,536
4Aug 3, 2026 21:3557,691291,739,137281,556,0001,130,0002,113,536
5Aug 3, 2026 21:3557,709291,851,400281,621,0001,156,0002,113,536
6Aug 3, 2026 21:3557,918292,843,830282,676,0001,127,0002,113,536
7Aug 3, 2026 21:3558,840297,398,599287,199,0001,120,0002,113,536
8Aug 3, 2026 21:3558,853297,482,110287,220,0001,160,0002,113,536
9Aug 3, 2026 21:3558,977298,004,032287,889,0001,102,0002,113,536