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 11, 2024 01:17Joad NacerJoad NacerScore: 5,114Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 01:175,04367,104,15139,812,0002,041,0002,334,720
2Oct 11, 2024 01:175,05766,507,48939,977,0001,998,0002,326,528
3Oct 11, 2024 01:175,06664,577,84940,047,0002,002,0002,510,848
4Oct 11, 2024 01:175,11463,909,76040,429,0002,021,0002,330,624
5Oct 11, 2024 01:175,15672,706,77240,808,0001,990,0002,330,624
6Oct 11, 2024 01:175,15872,208,86840,821,0001,991,0002,506,752