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 listAug 22, 2023 09:30matsuoka-601matsuoka-601Score: 22,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2023 09:3021,821244,834,970181,111,35602,277,376
2Aug 22, 2023 09:3021,838238,005,804181,254,97702,281,472
3Aug 22, 2023 09:3021,852234,663,075181,372,96802,281,472
4Aug 22, 2023 09:3022,549210,193,559186,154,0001,000,0002,367,488
5Aug 22, 2023 09:3022,566210,464,051186,294,0001,001,0002,285,568
6Aug 22, 2023 09:3022,576214,625,177186,376,0001,002,0002,519,040
7Aug 22, 2023 09:3022,576212,681,987186,376,0001,002,0002,285,568
8Aug 22, 2023 09:3022,578209,418,785186,396,0001,002,0002,269,184
9Aug 22, 2023 09:3022,599213,265,905187,573,00002,285,568
10Aug 22, 2023 09:3022,620216,928,911187,743,00002,277,376
11Aug 22, 2023 09:3022,620212,513,892185,748,0001,997,0002,285,568
12Aug 22, 2023 09:3022,623214,294,476185,771,0001,997,0002,285,568