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 listApr 29, 2024 17:07Steve HanSteve HanScore: 21,818Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2024 17:2819,402238,896,644161,032,84002,289,664
2Apr 29, 2024 17:2819,504212,081,634161,881,66402,297,856
3Apr 29, 2024 17:2819,527226,369,058162,075,14502,301,952
4Apr 29, 2024 17:2819,557231,578,069162,323,79802,252,800
5Apr 29, 2024 17:2819,566231,684,947162,401,61602,297,856
6Apr 29, 2024 17:2819,635229,854,842162,970,95502,301,952
7Apr 29, 2024 17:0821,818245,274,826181,087,96402,297,856
8Apr 29, 2024 17:0821,837242,200,881181,243,48802,301,952
9Apr 29, 2024 17:0721,861243,762,559181,448,54402,293,760
10Apr 29, 2024 17:0721,881245,325,214181,614,61002,289,664
11Apr 29, 2024 17:0821,896247,747,895181,738,83902,306,048
12Apr 29, 2024 17:0721,985234,563,697182,471,55402,293,760