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 listNov 14, 2024 22:45Manuel PepeManuel PepeScore: 119,994Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 14, 2024 22:45119,9181,022,073,755990,327,0004,996,0002,326,528
2Nov 14, 2024 22:45119,9701,018,652,740991,756,0003,999,0002,330,624
3Nov 14, 2024 22:45119,9911,025,937,832992,926,0002,999,0002,326,528
4Nov 14, 2024 22:45119,9931,021,557,651991,944,0003,999,0002,482,176
5Nov 14, 2024 22:45119,9941,022,005,758991,950,0003,999,0002,326,528
6Nov 14, 2024 22:45120,0241,024,506,721993,199,0003,000,0002,326,528
7Nov 14, 2024 22:45120,0391,019,414,846992,327,0003,997,0002,318,336
8Nov 14, 2024 22:45120,0411,026,591,134992,346,0003,997,0002,326,528
9Nov 14, 2024 22:45120,0441,024,192,762993,369,0002,998,0002,326,528