Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listApr 21, 2026 18:49Yuriy LyfenkoYuriy LyfenkoScore: 4,644Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 18:504,62257,051,02636,348,0002,019,0002,547,712
2Apr 21, 2026 18:504,62955,758,18336,399,0002,022,0002,338,816
3Apr 21, 2026 18:504,63758,035,76536,463,0002,025,0002,547,712
4Apr 21, 2026 18:504,63856,379,25536,475,0002,026,0002,551,808
5Apr 21, 2026 18:504,64457,058,31836,523,0002,029,0002,547,712
6Apr 21, 2026 18:504,65157,429,01036,578,0002,032,0002,338,816
7Apr 21, 2026 18:504,65955,020,81935,701,0002,975,0002,560,000
8Apr 21, 2026 18:504,66160,754,56936,652,0002,036,0002,547,712
9Apr 21, 2026 18:504,68054,466,93835,864,0002,988,0002,547,712