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 listJan 10, 2022 06:10Yuriy LyfenkoYuriy LyfenkoScore: 12,904Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2022 06:1012,870132,443,893105,824,000998,0002,289,664
2Jan 10, 2022 06:1012,884131,952,085104,936,0001,998,0002,277,376
3Jan 10, 2022 06:1012,896129,713,356106,034,0001,000,0002,289,664
4Jan 10, 2022 06:1012,897129,888,766106,044,0001,000,0002,277,376
5Jan 10, 2022 06:1012,899133,621,753105,064,0002,001,0002,289,664
6Jan 10, 2022 06:1012,900130,792,880106,070,0001,000,0002,289,664
7Jan 10, 2022 06:1012,904130,433,108105,102,0002,001,0002,281,472
8Jan 10, 2022 06:1012,915132,719,944105,191,0002,003,0002,289,664
9Jan 10, 2022 06:1012,947135,264,703106,457,0001,004,0002,273,280
10Jan 10, 2022 06:1013,235175,598,201109,852,55102,281,472
11Jan 10, 2022 06:1013,241183,279,086109,898,77702,277,376
12Jan 10, 2022 06:1013,248169,093,132109,960,25702,277,376