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 10, 2024 20:04Joad NacerJoad NacerScore: 8,940Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2024 20:048,65896,032,97369,862,0001,996,0002,351,104
2Oct 10, 2024 20:048,65997,042,16868,879,0002,994,0002,486,272
3Oct 10, 2024 20:048,67592,623,44670,006,0002,000,0002,486,272
4Oct 10, 2024 20:048,94094,534,08072,196,0002,005,0002,473,984
5Oct 10, 2024 20:048,94395,688,16671,217,0003,009,0002,482,176
6Oct 10, 2024 20:049,162102,460,95474,042,0002,001,0002,486,272