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 listJul 25, 2022 14:43Yuriy LyfenkoYuriy LyfenkoScore: 18,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2022 14:4318,719226,594,036155,371,55102,289,664
2Jul 25, 2022 14:4318,722216,250,610155,395,46602,240,512
3Jul 25, 2022 14:4318,829182,794,208154,277,0002,003,0002,396,160
4Jul 25, 2022 14:4318,867187,351,705154,590,0002,007,0002,433,024
5Jul 25, 2022 14:4318,867182,756,881155,594,0001,003,0002,482,176
6Jul 25, 2022 14:4318,924178,804,668155,066,0002,000,0002,445,312
7Jul 25, 2022 14:4318,932179,457,133156,139,0001,000,0002,433,024
8Jul 25, 2022 14:4319,025181,181,859153,907,0003,997,0002,416,640
9Jul 25, 2022 14:4319,367217,661,240160,742,23602,289,664
10Jul 25, 2022 14:4319,413184,956,531159,126,0002,001,0002,404,352
11Jul 25, 2022 14:4319,473186,447,961158,637,0002,993,0002,400,256
12Jul 25, 2022 14:4320,149192,440,747165,236,0002,002,0002,404,352