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 05:14anboto1anboto1Score: 61,767Success
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 05:1561,645312,069,265300,061,0002,001,0002,125,824
2Aug 4, 2026 05:1561,649310,791,372300,077,0002,004,0002,125,824
3Aug 4, 2026 05:1561,693311,062,042300,297,0002,002,0002,125,824
4Aug 4, 2026 05:1561,696311,061,704300,313,0002,001,0002,125,824
5Aug 4, 2026 05:1561,767311,125,471300,660,0002,003,0002,125,824
6Aug 4, 2026 05:1561,777311,168,961300,708,0002,004,0002,125,824
7Aug 4, 2026 05:1561,796311,290,010300,792,0002,010,0002,125,824
8Aug 4, 2026 05:1562,349315,035,438303,506,0002,008,0002,125,824
9Aug 4, 2026 05:1562,436314,631,930303,927,0002,010,0002,125,824