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 14, 2025 07:55Emanuele BolognesiEmanuele BolognesiScore: 64,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2025 07:5564,646562,610,775536,565,00002,355,200
2May 14, 2025 07:5564,647567,027,343535,567,000999,0002,355,200
3May 14, 2025 07:5564,648562,784,238534,579,0001,998,0002,285,568
4May 14, 2025 07:5564,648564,901,161534,582,0001,998,0002,355,200
5May 14, 2025 07:5564,650565,005,249535,600,000999,0002,363,392
6May 14, 2025 07:5564,650566,707,069535,595,000999,0002,371,584
7May 14, 2025 07:5564,650563,297,058534,601,0001,998,0002,359,296
8May 14, 2025 07:5564,653563,918,774534,618,0001,998,0002,285,568
9May 14, 2025 07:5564,659564,665,968534,668,0001,998,0002,355,200