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:20Victor MerckléVictor MerckléScore: 30,212Success
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:2430,043155,404,537145,198,0002,015,0002,117,632stderr
2Aug 24, 2026 17:2430,058155,455,178145,264,0002,023,0002,117,632stderr
3Aug 24, 2026 17:2430,142155,876,787146,687,0001,009,0002,117,632stderr
4Aug 24, 2026 17:2430,157156,851,040146,765,0001,009,0002,117,632stderr
5Aug 24, 2026 17:2430,212156,252,606147,029,0001,010,0002,117,632stderr
6Aug 24, 2026 17:2430,294156,667,877147,437,0001,008,0002,117,632stderr
7Aug 24, 2026 17:2430,302156,843,291147,470,0001,010,0002,117,632stderr
8Aug 24, 2026 17:2430,447157,348,987148,184,0001,010,0002,117,632stderr
9Aug 24, 2026 17:2430,480157,491,792148,346,0001,009,0002,117,632stderr