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 13:52Josu San MartinJosu San MartinScore: 25,269Success
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 13:5325,223132,064,891122,332,0001,262,0002,113,536
2Aug 4, 2026 13:5325,244132,078,143122,429,0001,269,0002,113,536
3Aug 4, 2026 13:5325,258132,231,207122,506,0001,261,0002,113,536
4Aug 4, 2026 13:5325,262132,356,025122,526,0001,258,0002,113,536
5Aug 4, 2026 13:5325,269132,183,577122,549,0001,270,0002,113,536
6Aug 4, 2026 13:5325,300132,317,751122,723,0001,249,0002,113,536
7Aug 4, 2026 13:5325,558133,622,893123,968,0001,270,0002,113,536
8Aug 4, 2026 13:5325,566133,706,324124,015,0001,261,0002,113,536
9Aug 4, 2026 13:5325,602133,890,154124,400,0001,050,0002,113,536