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 listOct 8, 2023 11:12Serge SmirnovSerge SmirnovScore: 43,737Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 8, 2023 11:1943,720427,715,368362,872,53502,285,568
2Oct 8, 2023 11:1243,723429,068,682362,903,94302,301,952
3Oct 8, 2023 11:1243,723426,380,682362,903,60102,252,800
4Oct 8, 2023 11:1343,730430,774,463362,957,69902,252,800
5Oct 8, 2023 11:1943,734420,678,472362,992,28602,285,568
6Oct 8, 2023 11:1943,736431,981,470363,005,36302,289,664
7Oct 8, 2023 11:1243,737444,609,294363,018,02602,285,568
8Oct 8, 2023 11:1343,738435,321,449363,025,21402,256,896
9Oct 8, 2023 11:1243,739421,869,343363,033,62302,285,568
10Oct 8, 2023 11:1243,742429,900,675363,055,95502,281,472
11Oct 8, 2023 11:1343,747434,641,289363,097,63002,289,664
12Oct 8, 2023 11:1243,750425,907,549363,126,62002,277,376