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 listJun 7, 2024 17:02GraceGraceScore: 39,666Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2024 17:0138,787385,188,478321,929,36702,265,088
2Jun 7, 2024 17:0139,019388,980,007323,854,66802,404,352
3Jun 7, 2024 17:0139,163387,009,805325,052,06002,277,376
4Jun 7, 2024 17:0239,213391,611,519325,465,84602,281,472
5Jun 7, 2024 17:0139,385399,519,504326,891,40202,265,088
6Jun 7, 2024 17:0139,585396,029,998328,552,91602,281,472
7Jun 7, 2024 17:0139,666390,536,964329,228,76502,281,472
8Jun 7, 2024 17:0140,023394,252,196332,187,87902,285,568
9Jun 7, 2024 17:0140,047393,290,470332,391,78302,273,280
10Jun 7, 2024 17:0240,396407,932,338335,290,14302,281,472
11Jun 7, 2024 17:0140,555399,303,807336,603,37902,281,472
12Jun 7, 2024 17:0240,566405,482,443336,701,55702,273,280