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 26, 2025 03:12nnScore: 355,215Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2025 03:12354,5102,963,274,3282,876,468,00065,964,0002,363,392
2Apr 26, 2025 03:12355,2152,976,274,9752,886,301,00061,984,0002,285,568
3Apr 26, 2025 03:12355,5702,980,955,5392,855,290,00095,942,0002,285,568