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 15, 2024 16:37Elnur RakhmatullinElnur RakhmatullinScore: 54,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 16:3754,442478,075,659449,869,0001,999,0002,277,376
2Oct 15, 2024 16:3754,444483,029,173450,890,000999,0002,277,376
3Oct 15, 2024 16:3754,446481,481,603450,901,000999,0002,273,280
4Oct 15, 2024 16:3754,453485,618,949448,960,0002,999,0002,281,472
5Oct 15, 2024 16:3754,454477,183,940449,966,0001,999,0002,277,376
6Oct 15, 2024 16:3754,467480,553,105450,079,0002,000,0002,277,376
7Oct 15, 2024 16:3754,487475,238,713451,241,0001,000,0002,277,376
8Oct 15, 2024 16:3754,559483,268,145451,844,000999,0002,273,280
9Oct 15, 2024 16:3755,347491,884,638458,384,0001,000,0002,277,376