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 listSep 3, 2026 02:46CheckHarryCheckHarryScore: 6,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 02:466,47663,595,49752,699,0001,052,0002,113,536
2Sep 3, 2026 02:466,47963,602,65052,612,0001,169,0002,113,536
3Sep 3, 2026 02:466,48764,836,77052,840,0001,007,0002,113,536
4Sep 3, 2026 02:466,49263,706,75052,828,0001,060,0002,113,536
5Sep 3, 2026 02:466,49363,732,80152,849,0001,047,0002,113,536
6Sep 3, 2026 02:466,50263,781,31852,927,0001,043,0002,113,536
7Sep 3, 2026 02:466,50263,813,12352,911,0001,062,0002,113,536
8Sep 3, 2026 02:466,67465,185,55554,355,0001,044,0002,113,536
9Sep 3, 2026 02:466,67665,234,34754,239,0001,175,0002,113,536