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 listApr 4, 2026 05:00limanjun99limanjun99Score: 119,824Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 4, 2026 05:00119,771610,306,587584,877,0001,999,0002,293,760
2Apr 4, 2026 05:00119,777608,340,499584,910,0001,999,0002,293,760
3Apr 4, 2026 05:00119,810610,245,071585,068,0002,000,0002,277,376
4Apr 4, 2026 05:00119,816609,816,618584,098,0003,000,0002,273,280
5Apr 4, 2026 05:00119,824616,777,040585,136,0002,000,0002,269,184
6Apr 4, 2026 05:00119,832614,999,860586,179,0001,000,0002,293,760
7Apr 4, 2026 05:00119,863613,922,591584,331,0002,996,0002,293,760
8Apr 4, 2026 05:00120,085615,716,380585,418,0002,997,0002,289,664
9Apr 4, 2026 05:00120,085612,846,792585,419,0002,997,0002,527,232