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, 2025 09:03limanjun99limanjun99Score: 46,473Success
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, 2025 09:0346,417414,007,925331,222,00054,036,0002,519,040
2Jun 7, 2025 09:0346,422412,529,297335,261,00050,039,0002,330,624
3Jun 7, 2025 09:0346,462414,300,098337,679,00047,954,0002,334,720
4Jun 7, 2025 09:0346,463410,168,656339,688,00045,957,0002,256,896
5Jun 7, 2025 09:0346,473412,702,090336,758,00048,964,0002,519,040
6Jun 7, 2025 09:0346,485413,079,765337,847,00047,978,0002,326,528
7Jun 7, 2025 09:0346,490413,325,337333,886,00051,982,0002,519,040
8Jun 7, 2025 09:0346,508410,546,258339,014,00047,001,0002,519,040
9Jun 7, 2025 09:0346,703412,320,410331,687,00055,947,0002,330,624