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:33Joad NacerJoad NacerScore: 4,598Success
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:334,51060,017,92435,406,0002,023,0002,334,720
2Oct 11, 2024 01:334,52766,915,67936,556,0001,015,0002,510,848
3Oct 11, 2024 01:334,53866,548,83135,631,0002,036,0002,334,720
4Oct 11, 2024 01:334,59858,616,06637,157,0001,004,0002,330,624
5Oct 11, 2024 01:334,60367,133,19037,198,0001,005,0002,330,624
6Oct 11, 2024 01:334,61766,860,89835,292,0003,025,0002,506,752