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 3, 2026 11:49Josu San MartinJosu San MartinScore: 31,249Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 11:5031,186161,940,614151,810,0001,004,0002,113,536
2Aug 3, 2026 11:5031,231162,174,765151,781,0001,253,0002,113,536
3Aug 3, 2026 11:5031,237161,534,457151,792,0001,272,0002,113,536
4Aug 3, 2026 11:5031,239163,728,328151,814,0001,261,0002,113,536
5Aug 3, 2026 11:5031,249162,178,001152,104,0001,017,0002,113,536
6Aug 3, 2026 11:5031,249162,163,091151,844,0001,277,0002,113,536
7Aug 3, 2026 11:5031,261162,053,923152,167,0001,013,0002,113,536
8Aug 3, 2026 11:5031,296162,503,118152,323,0001,030,0002,113,536
9Aug 3, 2026 11:5031,704163,834,923154,090,0001,261,0002,113,536