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 listFeb 10, 2023 20:10LiamLiamScore: 68,158Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2023 20:1067,974630,576,342564,181,83502,244,608
2Feb 10, 2023 20:1068,097626,159,325565,208,02202,244,608
3Feb 10, 2023 20:1168,118625,809,013565,379,74502,244,608
4Feb 10, 2023 20:1068,125621,778,102565,441,27202,244,608
5Feb 10, 2023 20:1168,158638,714,585565,712,10202,244,608
6Feb 10, 2023 20:1168,187606,724,656565,950,65802,236,416
7Feb 10, 2023 20:1097,876880,806,954812,371,11102,248,704
8Feb 10, 2023 20:1097,961890,730,109813,074,56402,248,704
9Feb 10, 2023 20:1098,491868,946,549817,475,32302,248,704