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 17:05Josu San MartinJosu San MartinScore: 25,172Success
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 17:0625,130131,564,939121,870,0001,270,0002,113,536
2Aug 4, 2026 17:0625,131131,623,676122,124,0001,018,0002,113,536
3Aug 4, 2026 17:0625,133131,566,902121,892,0001,264,0002,113,536
4Aug 4, 2026 17:0625,168132,396,799122,076,0001,248,0002,113,536
5Aug 4, 2026 17:0625,172131,740,202122,095,0001,252,0002,113,536
6Aug 4, 2026 17:0625,175131,775,928122,096,0001,263,0002,113,536
7Aug 4, 2026 17:0625,178132,511,369122,118,0001,256,0002,113,536
8Aug 4, 2026 17:0625,190131,832,793122,176,0001,258,0002,113,536
9Aug 4, 2026 17:0625,206131,944,869122,253,0001,261,0002,113,536