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 listMay 31, 2024 06:32GraceGraceScore: 7,388Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 31, 2024 06:327,363130,804,32161,116,90302,281,472
2May 31, 2024 06:327,380123,195,38761,254,44702,293,760
3May 31, 2024 06:327,381118,908,43761,265,62902,256,896
4May 31, 2024 06:327,384118,214,54461,284,42302,285,568
5May 31, 2024 06:327,388119,713,21161,319,09302,277,376
6May 31, 2024 06:327,389122,466,09261,325,87702,289,664
7May 31, 2024 06:327,410140,379,95761,506,76702,289,664
8May 31, 2024 06:327,417123,877,18861,558,95902,289,664
9May 31, 2024 06:327,426125,357,36661,632,44102,256,896