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 2, 2026 17:41Josu San MartinJosu San MartinScore: 30,879Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 17:4230,856161,980,655150,061,0001,137,0002,113,536
2Aug 2, 2026 17:4230,860162,010,762150,075,0001,140,0002,113,536
3Aug 2, 2026 17:4230,869162,099,587150,118,0001,142,0002,113,536
4Aug 2, 2026 17:4230,870161,268,817150,149,0001,115,0002,113,536
5Aug 2, 2026 17:4230,879161,368,055150,176,0001,133,0002,113,536
6Aug 2, 2026 17:4230,879162,026,585150,172,0001,137,0002,113,536
7Aug 2, 2026 17:4230,895162,168,825150,243,0001,143,0002,113,536
8Aug 2, 2026 17:4230,931161,590,225150,447,0001,118,0002,113,536
9Aug 2, 2026 17:4231,001163,379,541150,774,0001,132,0002,113,536