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 25, 2026 00:25Victor MerckléVictor MerckléScore: 27,988Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 00:2627,910145,216,010134,735,0002,027,0002,117,632stderr
2Aug 25, 2026 00:2627,912145,213,328135,761,0001,009,0002,117,632stderr
3Aug 25, 2026 00:2627,917145,851,746134,781,0002,016,0002,117,632stderr
4Aug 25, 2026 00:2627,982145,597,977135,101,0002,012,0002,117,632stderr
5Aug 25, 2026 00:2627,988145,577,819135,132,0002,010,0002,117,632stderr
6Aug 25, 2026 00:2628,053145,894,662135,442,0002,018,0002,117,632stderr
7Aug 25, 2026 00:2628,161146,379,918136,983,0001,010,0002,117,632stderr
8Aug 25, 2026 00:2628,220146,724,237136,261,0002,021,0002,117,632stderr
9Aug 25, 2026 00:2628,323147,237,688136,762,0002,025,0002,117,632stderr